IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0323015.html
   My bibliography  Save this article

A two-stage forecasting model using random forest subset-based feature selection and BiGRU with attention mechanism: Application to stock indices

Author

Listed:
  • Shafiqah Azman
  • Dharini Pathmanathan
  • Vimala Balakrishnan

Abstract

The heteroscedastic and volatile characteristics of stock price data have attracted the interest of researchers from various disciplines, particularly in the realm of price forecasting. The stock market’s non-stationary and volatile nature, driven by complex interrelationships among financial assets, economic developments, and market participants, poses significant challenges for accurate forecasting. This research aims to develop a robust forecasting model to improve the accuracy and reliability of stock price predictions using machine learning. A two-stage forecasting model is introduced. First, a random forest subset-based (RFS) feature selection with repeated k-fold cross-validation selects the best subset of features from eight predictors: highest price, lowest price, closing price, volume, change, price change ratio, and amplitude. These features are then used as input in a bidirectional gated recurrent unit with an attention mechanism (BiGRU-AM) model to forecast daily opening prices of ten stock indices. The proposed model exhibits superior forecasting performance across ten stock indices when compared to twelve benchmarks, evaluated using root mean squared error (RMSE), mean absolute error (MAE), and the coefficient of determination, R2. The improved prediction accuracy enables financial professionals to make more reliable investment decisions, reducing risks and increasing profits.

Suggested Citation

  • Shafiqah Azman & Dharini Pathmanathan & Vimala Balakrishnan, 2025. "A two-stage forecasting model using random forest subset-based feature selection and BiGRU with attention mechanism: Application to stock indices," PLOS ONE, Public Library of Science, vol. 20(5), pages 1-18, May.
  • Handle: RePEc:plo:pone00:0323015
    DOI: 10.1371/journal.pone.0323015
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0323015
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0323015&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0323015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0323015. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.