IDEAS home Printed from https://ideas.repec.org/a/alk/jcsts0/v4y2022i2id4056.html

Stock Price Prediction through STL Decomposition using Multivariate Two-way Long Short-term Memory

Author

Listed:
  • Junsuke Senoguchi

    (Tokyo University of Technology, School of Computer Science, Department of Computer Science, Japan)

Abstract

With advancements in machine-learning techniques, stock-price movements can ostensibly be forecasted using time-series data. In this study, several different types of long short-term memory (LSTM) are used to predict the closing prices of Japanese stocks five days into the future. Also, in this study, four different features [i.e., simple moving average (SMA), linear weighted moving average (WMA), exponential WMA (EMA), and the Savitzky–Golay (SG) metric] are generated from daily stock-price data and split into two components (i.e., trend and seasonal) by applying seasonal–trend decomposition using Loess (STL) decomposition. The prediction results are evaluated in terms of return, root-mean-square error (RMSE), mean absolute error (MAE), and other relevant measures of accuracy and relevancy. As a result, the multivariate two-way LSTM model yielded the highest overall performance. With respect to the RMSE and MAE of the training data, the multivariate two-way LSTM was not superior to the other models. However, with respect to RMSE and MAE on the validation data, it was the best. Also, the multivariate two-way LSTM model yielded the highest overall performance in terms of the accuracy of the direction of stock prices.

Suggested Citation

  • Junsuke Senoguchi, 2022. "Stock Price Prediction through STL Decomposition using Multivariate Two-way Long Short-term Memory," Journal of Computer Science and Technology Studies, Al-Kindi Center for Research and Development, vol. 4(2), pages 90-96, July.
  • Handle: RePEc:alk:jcsts0:v:4:y:2022:i:2:id:4056
    DOI: 10.32996/jcsts.2022.4.2.11
    as

    Download full text from publisher

    File URL: https://al-kindipublisher.com/index.php/jcsts/article/view/4056
    File Function: Abstract page
    Download Restriction: no

    File URL: https://al-kindipublisher.com/index.php/jcsts/article/download/4056/3512
    File Function: Full text
    Download Restriction: no

    File URL: https://libkey.io/10.32996/jcsts.2022.4.2.11?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

    Keywords

    ;
    ;
    ;
    ;

    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:alk:jcsts0:v:4:y:2022:i:2:id:4056. 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: Al-Kindi Center for Research and Development (email available below). General contact details of provider: https://al-kindipublisher.com/index.php/jcsts .

    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.