Towards building a hybrid model for predicting stock indexes
Bibliographic record
Abstract
Predicting stock prices using computer generated models has been a popular research topic and has also been widely explored. However, the connectivity of the global financial market, availability of big data in multiple domains that influence the financial market, accessibility of information in real time and the demand for fast analytics continue to offer new research challenges. One of the complexities stems from the numerous ways in which we seek to set prediction parameters, whether it is the difference in an individual stocks' growth pattern or the time frame in which the predictions occur. The level of complexity has created a trend towards more advanced techniques in this field namely, the research into developing hybrid models that are composed of multiple prediction models with a view to yield more accurate results. The Proposed Hybrid Model (PHM) used in this paper is a combination of an Exponential Smoothing Model (ESM), an Auto Regressive Integrated Moving Average (ARIMA) model, and a Back-propagation Neural Network (BPNN) model. PHM combines the predictions of each of the component model based on weights assigned by a genetic algorithm, which is designed to provide an optimum output. In this paper, we seek to use the S&P 400 and 500 indexes to train and test the PHM to find daily closing values. For comparison of the results, Directional Accuracy (DA) is used as a metric. It was found that the results for the ARIMA and ESM on daily stock index data were far less accurate than that of the BPNN, which received comparable results to the baseline. However, due to the poor results of the ARIMA and ESM the hybrid model showed no significant results for the data and was inferior to the baseline.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".