Return forecasting of sub-new stocks via ADARNN Trained with Mixed Historical Data

Forecasting the return rates of sub-new stocks has always been a challenging problem. Typically, machine learning methods such as support vector machines and neural networks require a large amount of training data to ensure the effectiveness of the model. However, due to the limited historical trading data for sub-new stocks, these methods often fail to achieve satisfactory results. Based on the adaptive recurrent neural network (AdaRNN) model, a time concatenation method based on equal segmentation (ES-STC) is proposed to forecast the return rates of sub-new stocks. Our approach mixes old and sub-new stock data using a unique data fusion strategy to improve the model's performance on sub-new stocks. The feasibility of this method in forecasting the return of sub-new stocks is verified through experiments, and compared with baseline models such as ALSTM, Transformer, LSTM, and GRU. The results indicate that the performance of the ES-STC surpasses those of other baseline models. For example, compared to the ADARNN, our method shows an average improvement of 9.9% in the ICIR indicator and 3.7% in the IC indicator. Our findings reveal that: 1) Combining sub-new and old stocks in certain sectors (e.g., automotive and news media) can enhance the predictive performance of the model. 2) The ES-STC is better than ADARNN and other benchmark models in certain sectors (e.g., automotive and news media).

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1145/3700058.3700069
Citations
1
Primary Topic
Stock Market Forecasting Methods
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Return forecasting of sub-new stocks via ADARNN Trained with Mixed Historical Data

Peng Chen, Lieping Zhang, Zhenkun Liu, Hailing He
1 citations
Stock Market Forecasting Methods
0.49
article

Return forecasting of sub-new stocks via ADARNN Trained with Mixed Historical Data

Peng Chen, Lieping Zhang, Zhenkun Liu, Hailing He
article en
1 citations

Abstract

Forecasting the return rates of sub-new stocks has always been a challenging problem. Typically, machine learning methods such as support vector machines and neural networks require a large amount of training data to ensure the effectiveness of the model. However, due to the limited historical trading data for sub-new stocks, these methods often fail to achieve satisfactory results. Based on the adaptive recurrent neural network (AdaRNN) model, a time concatenation method based on equal segmentation (ES-STC) is proposed to forecast the return rates of sub-new stocks. Our approach mixes old and sub-new stock data using a unique data fusion strategy to improve the model's performance on sub-new stocks. The feasibility of this method in forecasting the return of sub-new stocks is verified through experiments, and compared with baseline models such as ALSTM, Transformer, LSTM, and GRU. The results indicate that the performance of the ES-STC surpasses those of other baseline models. For example, compared to the ADARNN, our method shows an average improvement of 9.9% in the ICIR indicator and 3.7% in the IC indicator. Our findings reveal that: 1) Combining sub-new and old stocks in certain sectors (e.g., automotive and news media) can enhance the predictive performance of the model. 2) The ES-STC is better than ADARNN and other benchmark models in certain sectors (e.g., automotive and news media).

Jishou University (CN)
Climate action
Openalex Percentile: Top 28%
Stock Market Forecasting Methods
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.