Comparison of Deep Learning Techniques for River Streamflow Forecasting
Xuan-Hien Le, Duc-Hai Nguyen, Sungho Jung and 2 more
IEEE Access · 2021
doi:10.1109/access.2021.3077703 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.