The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Comparison of Deep Learning Techniques for River Streamflow Forecasting
Open accessAbstract
Recently, deep learning (DL) models, especially those based on long short-term memory (LSTM), have demonstrated their superior ability in resolving sequential data problems. This study investigated the performance of six models that belong to the supervised learning category to evaluate the performance of DL models in terms of streamflow forecasting. They include a feed-forward neural network (FFNN), a convolutional neural network (CNN), and four LSTM-based models. Two standard models with just one hidden layer-LSTM and gated recurrent unit (GRU)-are used against two more complex models-the stacked LSTM (StackedLSTM) model and the Bidirectional LSTM (BiLSTM) model. The Red River basin-the largest river basin in the north of Vietnam-was adopted as a case study because of its geographic relevance since Hanoi city-the capital of Vietnam-is located downstream of the Red River. Besides, the input data of these models are the observed data at seven hydrological stations on the three main river branches of the Red River system. This study indicates that the four LSTM-based models exhibited considerably better performance and maintained stability than the FFNN and CNN models. However, the complexity of the StackedLSTM and BiLSTM models is not accompanied by performance improvement because the results of the comparison illustrate that their respective performance is not higher than the two standard models-LSTM and GRU. The findings of this study present that LSTM-based models can reach impressive forecasts even in the presence of upstream dams and reservoirs. For the streamflow-forecasting problem, the LSTM and GRU models with a simple architecture (one hidden layer) are sufficient to produce highly reliable forecasts while minimizing the computation time.
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
Chung, J., Gulcehre, C., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.3555 · Cited by 11,008
TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
Abadi, M., Agarwal, A., Barham, P., Brevdo, E., Chen, Z., Citro, C., Corrado, G. S., Davis, A., Dean, J., Devin, M., et al. (2016) · arXiv · doi:10.48550/arxiv.1603.04467 · Cited by 9,408
Speech recognition with deep recurrent neural networks
Graves, A., Mohamed, A.-R., & Hinton, G. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638947 · Cited by 8,893
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542 · cited 1×
“This might be due to the complexity of building an ANN-based ML model when working with time-series data and the close relationship of observed data with the subsequently observed values [9], [10].”
BackgroundConvolutional LSTM Network: A Machine Learning Approach for Precipitation Nowcasting
Shi, X., Chen, Z., Wang, H., Yeung, D.-Y., Wong, W.-K., & Woo, W.-C. (2015) · arXiv · doi:10.48550/arxiv.1506.04214 · Cited by 7,709
Object Detection With Deep Learning: A Review
Zhao, Z.-Q., Zheng, P., Xu, S.-T., & Wu, X. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2876865 · Cited by 5,545
Cited by
Ahmed, A. A., Sayed, S., Abdoulhalik, A., Moutari, S., & Oyedele, L. (2024) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2024.140715 · Cited by 260
Metadata
- Authors
- Le, X.-H., Nguyen, D.-H., Jung, S., Yeon, M., & Lee, G.
- Venue
- IEEE Access
- Published
- 2021
- Volume
- 9
- Pages
- 71805-71820
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3158774913
- Cited by
- 171
- References
- 9
- FWCI
- 7.98
- Type
- journal article
- Language
- en
- Open access
- gold
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.