IDEAS home Printed from https://ideas.repec.org/a/aac/ijirss/v5y2022i2p121-133id415.html
   My bibliography  Save this article

Hyperparameter Optimization of Long-Short Term Memory using Symbiotic Organism Search for Stock Prediction

Author

Listed:
  • Dinar Syahid Nur Ulum
  • Abba Suganda Girsang

Abstract

Producing the best possible predictive result from long-short term memory (LSTM) requires hyperparameters to be tuned by a data scientist or researcher. A metaheuristic algorithm was used to optimize hyperparameter tuning and reduce the computational complexity to improve the manual process. Symbiotic organism search (SOS), which was introduced in 2014, is an algorithm that simulates the symbiotic interactions that organisms use to survive in an ecosystem. SOS offers an advantage over other metaheuristic algorithms in that it has fewer parameters, allowing it to avoid parameter determination errors and produce suboptimal solutions. SOS was used to optimize hyperparameter tuning in LSTM for stock prediction. The stock prices were time-series data, and LSTM has proven to be a popular method for time-series forecasting. This research employed the Indonesia composite index dataset and assessed it using root mean square error (RMSE) as a key indicator and the fitness function for the metaheuristic approach. Genetic algorithm (GA) and particle swarm optimization (PSO) were used as benchmarking algorithms in this research. The hybrid SOS-LSTM model outperformed GA-LSTM and PSO-LSTM with an RMSE of 78.799, compared to the GA-LSTM model with an RMSE of 142.663 and the PSO-LSTM model with an RMSE of 529.170.

Suggested Citation

  • Dinar Syahid Nur Ulum & Abba Suganda Girsang, 2022. "Hyperparameter Optimization of Long-Short Term Memory using Symbiotic Organism Search for Stock Prediction," International Journal of Innovative Research and Scientific Studies, Innovative Research Publishing, vol. 5(2), pages 121-133.
  • Handle: RePEc:aac:ijirss:v:5:y:2022:i:2:p:121-133:id:415
    as

    Download full text from publisher

    File URL: http://www.ijirss.com/index.php/ijirss/article/view/415/256
    Download Restriction: no

    File URL: http://www.ijirss.com/index.php/ijirss/article/view/415/278
    Download Restriction: no
    ---><---

    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:aac:ijirss:v:5:y:2022:i:2:p:121-133:id:415. 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: Natalie Jean (email available below). General contact details of provider: https://ijirss.com/index.php/ijirss/ .

    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.