Search

Candlesticks are widely used as an effective technical analysis tool in financial markets. Traditionally, different combinations of candlesticks have formed specific bullish/bearish patterns providing investors with increased opportunities for profitable trades. However, most patterns derived from subjective expertise without quantitative analysis. In this article, combining bullish/bearish patterns with ensemble learning, we present an intelligent system for making stock trading decisions. The Ensemble Classifier through Multimodal Perturbation (ECMP) is designed to generate a diverse set of precise base classifiers to further determine the candlestick patterns. It achieves this by: first, introducing perturbations to the sample space through bootstrap sampling; second, employing an attribute reduction algorithm based on neighborhood rough set theory to select relevant features; third, perturbing the feature space through random subspace selection. Ultimately, the trading decisions are guided by the classification outcomes of this procedure. To evaluate the proposed model, we apply it to empirical investigations within the context of the Chinese stock market. The results obtained from our experiments clearly demonstrate the effectiveness of the approach. [ABSTRACT FROM AUTHOR]

Digital library as one of the most important ways in helping students acquire professional knowledge and improve their professional level has gained great attention in recent years. However, its large collection (especially the book resources) hinders students from finding the resources that they are interested in. To overcome this challenge, many researchers have already turned to recommendation algorithms. Compared with traditional recommendation tasks, in the digital library, there are two challenges in book recommendation problems. The first is that users may borrow books that they are not interested in (i.e., noisy borrowing behaviours), such as borrowing books for classmates. The second is that the number of books in a digital library is usually very large, which means one student can only borrow a small set of books in history (i.e., data sparsity issue). As the noisy interactions in students' borrowing sequences may harm the recommendation performance of a book recommender, we focus on refining recommendations via filtering out data noises. Moreover, due to the the lack of direct supervision information, we treat noise filtering in sequences as a decision-making process and innovatively introduce a reinforcement learning method as our recommendation framework. Furthermore, to overcome the sparsity issue of students' borrowing behaviours, a clustering-based reinforcement learning algorithm is further developed. Experimental results on two real-world datasets demonstrate the superiority of our proposed method compared with several state-of-the-art recommendation methods. [ABSTRACT FROM AUTHOR]

This article presents a global adaptive neural-network-based control algorithm for disturbed pure-feedback nonlinear systems to achieve zero tracking error in a predefined time. Different from the traditional works that only solve the semiglobal bounded tracking problem for pure-feedback systems, this work not only achieves that the tracking error globally converges to zero but also guarantees that the convergence time can be predefined according to the user specification. In order to get the desired predefined-time controller, first, a mild semibound assumption for nonaffine functions is skillfully proposed so that the design difficulty caused by the structure of pure feedback can be easily solved. Then, we apply the property of radial basis function (RBF) neural networks (NNs) and Young's inequality to derive the upper bound of the term that contains the unknown nonlinear function and external disturbances, and the designed adaptive parameters decide the derived upper and robust control gain. Finally, the predefined-time virtual control inputs are presented whose derivatives are further estimated by utilizing finite-time differentiators. It is strictly proved that the proposed novel predefined-time controller can guarantee that the tracking error globally converges to zero within predefined time and a practical example is shown to verify the effectiveness and practicability of the proposed predefined-time control method.