Assessment of Machine Learning Techniques for Monthly Flow Prediction
- Authors
- Alizadeh, Zahra; Yazdi, Jafar; Kim, Joong Hoon; Al-Shamiri, Abobakr Khalil
- Issue Date
- 11월-2018
- Publisher
- MDPI
- Keywords
- Gaussian process regression; grasshopper optimization algorithm; K-nearest neighbor regression; neural network; support vector machine
- Citation
- WATER, v.10, no.11
- Indexed
- SCIE
SCOPUS
- Journal Title
- WATER
- Volume
- 10
- Number
- 11
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/72025
- DOI
- 10.3390/w10111676
- ISSN
- 2073-4441
- Abstract
- Monthly flow predictions provide an essential basis for efficient decision-making regarding water resource allocation. In this paper, the performance of different popular data-driven models for monthly flow prediction is assessed to detect the appropriate model. The considered methods include feedforward neural networks (FFNNs), time delay neural networks (TDNNs), radial basis neural networks (RBFNNs), recurrent neural network (RNN), a grasshopper optimization algorithm (GOA)-based support vector machine (SVM) and K-nearest neighbors (KNN) model. For this purpose, the performance of each model is evaluated in terms of several residual metrics using a monthly flow time series for two real case studies with different flow regimes. The results show that the KNN outperforms the different neural network configurations for the first case study, whereas RBFNN model has better performance for the second case study in terms of the correlation coefficient. According to the accuracy of the results, in the first case study with more input features, the KNN model is recommended for short-term predictions and for the second case with a smaller number of input features, but more training observations, the RBFNN model is suitable.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Civil, Environmental and Architectural Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.