A predictive system integrating intrinsic mode functions, artificial neural networks, and genetic algorithms for forecasting S&P500 intra‐day data
Bibliographic record
Abstract
Summary There is an abundant literature on the design of intelligent systems to forecast stock market indices. In general, the existing stock market price forecasting approaches can achieve good results. The goal of our study is to develop an effective intelligent predictive system to improve the forecasting accuracy. Therefore, our proposed predictive system integrates adaptive filtering, artificial neural networks (ANNs), and evolutionary optimization. Specifically, it is based on the empirical mode decomposition (EMD), which is a useful adaptive signal‐processing technique, and ANNs, which are powerful adaptive intelligent systems suitable for noisy data learning and prediction, such as stock market intra‐day data. Our system hybridizes intrinsic mode functions (IMFs) obtained from EMD and ANNs optimized by genetic algorithms (GAs) for the analysis and forecasting of S&P500 intra‐day price data. For comparison purposes, the performance of the EMD‐GA‐ANN presented is compared with that of a GA‐ANN trained with a wavelet transform's (WT's) resulting approximation and details coefficients, and a GA‐general regression neural network (GRNN) trained with price historical data. The mean absolute deviation, mean absolute error, and root‐mean‐squared errors show evidence of the superiority of EMD‐GA‐ANN over WT‐GA‐ANN and GA‐GRNN. In addition, it outperformed existing predictive systems tested on the same data set. Furthermore, our hybrid predictive system is relatively easy to implement and not highly time‐consuming to run. Furthermore, it was found that the Daubechies wavelet showed quite a higher prediction accuracy than the Haar wavelet. Moreover, prediction errors decrease with the level of decomposition.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".