Accurate stock prediction plays an important role in financial markets and can aid investors in making well-informed decisions and optimizing their investment strategies. Relationships exist among stocks in the market, leading to high correlation in their prices. Recently, several methods have been proposed to mine such relationships in order to enhance forecasting results. However, previous works have focused on exploring the correlations among stocks while neglecting the causal characteristics, thereby restricting the predictive performance. Furthermore, due to the diversity of relationships, existing methods are unable to handle both dynamic and static relationships simultaneously. To address the limitations of prior research, we introduce a novel stock trend forecasting framework capable of mining the causal relationships that affect changes in companies’ stock prices and simultaneously extracts both dynamic and static features to enhance the forecasting performance. Extensive experimental results in the Chinese stock market demonstrate that the proposed framework achieves obvious improvement against multiple state-of-the-art approaches.

Despite considerable research efforts being devoted to the taxi cruising route recommendation (TCRR) problem, existing studies still have some shortcomings. To begin with, the competition and collaboration between taxis are not sufficiently taken into account. Furthermore, the TCRR is heavily reliant on potential taxi demand, which is time-variant and difficult to accurately predict due to the underlying spatiotemporal correlation and dynamic traffic patterns. Moreover, the consideration of competition and cooperation among taxis increases the complexity of the TCRR problem, making conventional centralized algorithms computationally expensive. In this paper, we first formulate TCRR as a biobjective optimization problem to balance the collaboration and competition between taxis. Subsequently, we forecast short-term taxi demand using the proposed long-short-term-memory-based graph convolutional network (LSTM-GCN), which considers diverse factors such as road topology, points of interest (POIs), and multiple time-scale features. Lastly, we propose a distributed algorithm based on a Lagrange dual decomposition. The experimental and simulation results demonstrate that our TCRR scheme performs better than any other counterpart, (i) resulting in a $3\%$ reduction in idle taxis per hour, (ii) performing four times faster than the centralized algorithms to obtain the optimal solution, and (iii) resulting in a $7\%$ increase in average profit.