The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The Performance of LSTM and BiLSTM in Forecasting Time Series
Abstract
Machine and deep learning-based algorithms are the emerging approaches in addressing prediction problems in time series. These techniques have been shown to produce more accurate results than conventional regression-based modeling. It has been reported that artificial Recurrent Neural Networks (RNN) with memory, such as Long Short-Term Memory (LSTM), are superior compared to Autoregressive Integrated Moving Average (ARIMA) with a large margin. The LSTM-based models incorporate additional “gates” for the purpose of memorizing longer sequences of input data. The major question is that whether the gates incorporated in the LSTM architecture already offers a good prediction and whether additional training of data would be necessary to further improve the prediction. Bidirectional LSTMs (BiLSTMs) enable additional training by traversing the input data twice (i.e., 1) left-to-right, and 2) right-to-left). The research question of interest is then whether BiLSTM, with additional training capability, outperforms regular unidirectional LSTM. This paper reports a behavioral analysis and comparison of BiLSTM and LSTM models. The objective is to explore to what extend additional layers of training of data would be beneficial to tune the involved parameters. The results show that additional training of data and thus BiLSTM-based modeling offers better predictions than regular LSTM-based models. More specifically, it was observed that BiLSTM models provide better predictions compared to ARIMA and LSTM models. It was also observed that BiLSTM models reach the equilibrium much slower than LSTM-based models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Time Series Analysis: Forecasting and Control
Geurts, M., Box, G. E. P., & Jenkins, G. M. (1977) · Journal of Marketing Research · doi:10.2307/3150485 · Cited by 19,186
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Bidirectional recurrent neural networks
Schuster, M., & Paliwal, K. K. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650093 · Cited by 10,172 · cited 2×
“The deep-bidirectional LSTMs (BiLSTM) networks [25] are a variation of normal LSTMs (Figure 1(d)), in which the desired model is trained not only from inputs to outputs, but also from outputs to inputs.”
BackgroundMethodTime Series Analysis Forecasting and Control.
Bartholomew, D. J., Box, G. E. P., & Jenkins, G. M. (1971) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008255 · Cited by 6,716
Learning to forget: Continual prediction with LSTM
Gers, F. A., Schmidhuber, J., & Cummins, F. (2000) · Neural Computation · doi:10.1162/089976600300015015 · Cited by 4,823
Forecasting principles and practice
Hyndman, R. J., & Athanasopoulos, G. (2018) · Cited by 4,405
Deep learning with long short-term memory networks for financial market predictions
Fischer, T., & Krauss, C. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.11.054 · Cited by 2,785
A Comparison of ARIMA and LSTM in Forecasting Time Series
Siami-Namini, S., Tavakoli, N., & Siami Namin, A. (2018) · 2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA) · doi:10.1109/icmla.2018.00227 · Cited by 1,387
Self-citationStock Price Prediction Using the ARIMA Model
Ariyo, A. A., Adewumi, A. O., & Ayo, C. K. (2014) · 2014 UKSim-AMSS 16th International Conference on Computer Modelling and Simulation · doi:10.1109/uksim.2014.67 · Cited by 1,043
A novel hybridization of artificial neural networks and ARIMA models for time series forecasting
Khashei, M., & Bijari, M. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.10.015 · Cited by 821
Deep neural networks, gradient-boosted trees, random forests: Statistical arbitrage on the S&P 500
Krauss, C., Do, X. A., & Huck, N. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.10.031 · Cited by 750 · cited 1×
“Krauss et al. [19] used various forms of forecasting models such as deep learning, gradient-boosted trees, and random forests to model S&P 500 constitutes.”
BackgroundExploiting the past and the future in protein secondary structure prediction
Baldi, P., Brunak, S., Frasconi, P., Soda, G., & Pollastri, G. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.11.937 · Cited by 497
Deep Learning: A Practitioner's Approach
Patterson, J., & Adam, G. (2017) · Cited by 486
Kane, M. J., Price, N., Scotch, M., & Rabinowitz, P. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-276 · Cited by 328
Earnest, A., Chen, M. I., Ng, D., & Sin, L. Y. (2005) · BMC Health Services Research · doi:10.1186/1472-6963-5-36 · Cited by 189
Pairs selection and outranking: An application to the S&P 100 index
Huck, N. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2008.03.025 · Cited by 140
Miller, G. (2004) · Science · doi:10.1126/science.304.5667.34 · Cited by 130
BiLSTM model based on multivariate time series data in multiple field for forecasting trading area
Kim, J., & Moon, N. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-019-01398-9 · Cited by 119
Expanded-Size Bases in Naturally Sized DNA: Evaluation of Steric Effects in Watson−Crick Pairing
Gao, J., Liu, H., & Kool, E. T. (2004) · Journal of the American Chemical Society · doi:10.1021/ja048499a · Cited by 109
Predicting Vulnerable Software Components through N-Gram Analysis and Statistical Feature Selection
Pang, Y., Xue, X., & Namin, A. S. (2015) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2015.99 · Cited by 101
Self-citationModeling Genome Data Using Bidirectional LSTM
Tavakoli, N. (2019) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac.2019.10204 · Cited by 40
Self-citationA Deep Efficient Frontier Method for Optimal InvestmentsPreprint
Lee, S. I., & Yoo, S. J. (2017) · arXiv (Cornell University) · Cited by 12
Cited by
Sarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00815-1 · Cited by 2,678
Deep learning modelling techniques: Current progress, applications, advantages, and challenges
Ahmed, S. F., Alam, M. S. B., Hassan, M., Rozbu, M. R., Ishtiak, T., Rafa, N., Mofijur, M., Shawkat Ali, A. B. M., & Gandomi, A. H. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10466-8 · Cited by 1,079
Stock price prediction using deep learning and frequency decomposition
Rezaei, H., Faaljou, H., & Mansourfar, G. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114332 · Cited by 372
Hong, Z., Li, Z., Zhong, S., Lyu, W., Wang, H., Ding, Y., He, T., & Zhang, D. (2024) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3659597 · Cited by 67
Ferreira Mello, R., Pereira Junior, C., Rodrigues, L., Pereira, F. D., Cabral, L., Costa, N., Ramalho, G., & Gasevic, D. (2025) · Proceedings of the 15th International Learning Analytics and Knowledge Conference · doi:10.1145/3706468.3706481 · Cited by 41
Metadata
- Authors
- Siami-Namini, S., Tavakoli, N., & Namin, A. S.
- Venue
- 2019 IEEE International Conference on Big Data (Big Data)
- Publisher
- IEEE
- Published
- 2019-12
- Pages
- 3285-3292
- OpenAlex
- W3007075806
- Cited by
- 1,574
- References
- 23
- FWCI
- 101.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.