Pub Date : 2020-08-05DOI: 10.1142/s1469026820500224
S. Akram
Groundwater management problems are typically of a large-scale nature, involving complex nonlinear objective functions and constraints, which are commonly evaluated through the use of numerical simulation models. Given these complexities, metaheuristic optimization algorithms have recently become popular choice for solving such complex problems which are difficult to solve by traditional methods. However, the practical applications of metaheuristics are severely challenged by the requirement of large number of function evaluations to achieve convergence. To overcome this shortcoming, many new metaheuristics and different variants of existing ones have been proposed in recent years. In this study, a recently developed algorithm called flower pollination algorithm (FPA) is investigated for optimal groundwater management. The FPA is improved, combined with the widely used groundwater flow simulation model MODFLOW, and applied to solve two groundwater management problems. The proposed algorithm, denoted as IFPA, is first tested on a hypothetical aquifer system, to minimize the total pumping to contain contaminated groundwater within a capture zone. IFPA is then applied to maximize the total annual pumping from existing wells in Rhis-Nekor unconfined coastal aquifer on the northern of Morocco. The obtained results indicate that IFPA is a promising method for solving groundwater management problems as it outperforms the standard FPA and other algorithms applied to the case studies considered, both in terms of convergence rate and solution quality.
{"title":"Improved Flower Pollination Algorithm for Optimal Groundwater Management","authors":"S. Akram","doi":"10.1142/s1469026820500224","DOIUrl":"https://doi.org/10.1142/s1469026820500224","url":null,"abstract":"Groundwater management problems are typically of a large-scale nature, involving complex nonlinear objective functions and constraints, which are commonly evaluated through the use of numerical simulation models. Given these complexities, metaheuristic optimization algorithms have recently become popular choice for solving such complex problems which are difficult to solve by traditional methods. However, the practical applications of metaheuristics are severely challenged by the requirement of large number of function evaluations to achieve convergence. To overcome this shortcoming, many new metaheuristics and different variants of existing ones have been proposed in recent years. In this study, a recently developed algorithm called flower pollination algorithm (FPA) is investigated for optimal groundwater management. The FPA is improved, combined with the widely used groundwater flow simulation model MODFLOW, and applied to solve two groundwater management problems. The proposed algorithm, denoted as IFPA, is first tested on a hypothetical aquifer system, to minimize the total pumping to contain contaminated groundwater within a capture zone. IFPA is then applied to maximize the total annual pumping from existing wells in Rhis-Nekor unconfined coastal aquifer on the northern of Morocco. The obtained results indicate that IFPA is a promising method for solving groundwater management problems as it outperforms the standard FPA and other algorithms applied to the case studies considered, both in terms of convergence rate and solution quality.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133680336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s146902682050011x
Teng Jiang, Liang Gong, Yupu Yang
Attention-based encoder–decoder framework has greatly improved image caption generation tasks. The attention mechanism plays a transitional role by transforming static image features into sequential captions. To generate reasonable captions, it is of great significance to detect spatial characteristics of images. In this paper, we propose a spatial relational attention approach to consider spatial positions and attributes. Image features are firstly weighted by the attention mechanism. Then they are concatenated with contextual features to form a spatial–visual tensor. The tensor is feature extracted by a fully convolutional network to produce visual concepts for the decoder network. The fully convolutional layers maintain spatial topology of images. Experiments conducted on the three benchmark datasets, namely Flickr8k, Flickr30k and MSCOCO, demonstrate the effectiveness of our proposed approach. Captions generated by the spatial relational attention method precisely capture spatial relations of objects.
{"title":"Spatial Relational Attention Using Fully Convolutional Networks for Image Caption Generation","authors":"Teng Jiang, Liang Gong, Yupu Yang","doi":"10.1142/s146902682050011x","DOIUrl":"https://doi.org/10.1142/s146902682050011x","url":null,"abstract":"Attention-based encoder–decoder framework has greatly improved image caption generation tasks. The attention mechanism plays a transitional role by transforming static image features into sequential captions. To generate reasonable captions, it is of great significance to detect spatial characteristics of images. In this paper, we propose a spatial relational attention approach to consider spatial positions and attributes. Image features are firstly weighted by the attention mechanism. Then they are concatenated with contextual features to form a spatial–visual tensor. The tensor is feature extracted by a fully convolutional network to produce visual concepts for the decoder network. The fully convolutional layers maintain spatial topology of images. Experiments conducted on the three benchmark datasets, namely Flickr8k, Flickr30k and MSCOCO, demonstrate the effectiveness of our proposed approach. Captions generated by the spatial relational attention method precisely capture spatial relations of objects.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128774808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In view of the multipeak characteristics of a photovoltaic (PV) array P–V curve under local shadow conditions and that the traditional maximum power point tracking (MPPT) algorithm cannot effectively track the maximum power point of the curve, a multipeak MPPT algorithm based on a chaotic quantum bee colony and support vector regression (SVR) is proposed. By constructing and analyzing the mathematical model of a photovoltaic array under a local shadow, the P–V characteristic equation of the photovoltaic array is obtained. The improved strategy of the artificial bee colony algorithm is studied, and the improved chaotic quantum bee colony algorithm (CQABC) is applied to the optimization of SVR parameters; this application improves the accuracy and generalization performance of the maximum power point prediction model based on SVR. The calculation process of the multipeak MPPT algorithm based on CQABC-SVR is given, and the effectiveness of the algorithm is verified by simulation and testing. The experimental results show that the algorithm can accurately track the global maximum power point under uniform illumination or local shadow conditions, effectively overcoming the problem of traditional MPPT algorithms easily falling into local extrema.
{"title":"Application of a Chaotic Quantum Bee Colony and Support Vector Regression to Multipeak Maximum Power Point Tracking Control Method Under Partial Shading Conditions","authors":"Xiang-ming Gao, Diankuan Ding, Shifeng Yang, Mingkun Huang","doi":"10.1142/s1469026820500145","DOIUrl":"https://doi.org/10.1142/s1469026820500145","url":null,"abstract":"In view of the multipeak characteristics of a photovoltaic (PV) array P–V curve under local shadow conditions and that the traditional maximum power point tracking (MPPT) algorithm cannot effectively track the maximum power point of the curve, a multipeak MPPT algorithm based on a chaotic quantum bee colony and support vector regression (SVR) is proposed. By constructing and analyzing the mathematical model of a photovoltaic array under a local shadow, the P–V characteristic equation of the photovoltaic array is obtained. The improved strategy of the artificial bee colony algorithm is studied, and the improved chaotic quantum bee colony algorithm (CQABC) is applied to the optimization of SVR parameters; this application improves the accuracy and generalization performance of the maximum power point prediction model based on SVR. The calculation process of the multipeak MPPT algorithm based on CQABC-SVR is given, and the effectiveness of the algorithm is verified by simulation and testing. The experimental results show that the algorithm can accurately track the global maximum power point under uniform illumination or local shadow conditions, effectively overcoming the problem of traditional MPPT algorithms easily falling into local extrema.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130323656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s1469026820500108
Mahdi Bidar, Malek Mouhoub, S. Sadaoui, H. Kanan
Constraint optimization consists of looking for an optimal solution maximizing a given objective function while meeting a set of constraints. In this study, we propose a new algorithm based on mushroom reproduction for solving constraint optimization problems. Our algorithm, that we call Mushroom Reproduction Optimization (MRO), is inspired by the natural reproduction and growth mechanisms of mushrooms. This process includes the discovery of rich areas with good living conditions allowing spores to grow and develop their own colonies. Given that constraint optimization problems often suffer from a high-time computation cost, we thoroughly assess MRO performance on well-known constrained engineering and real-world problems. The experimental results confirm the high performance of MRO, comparing to other known metaheursitcs, in dealing with complex optimization problems.
{"title":"A Novel Nature-Inspired Technique Based on Mushroom Reproduction for Constraint Solving and Optimization","authors":"Mahdi Bidar, Malek Mouhoub, S. Sadaoui, H. Kanan","doi":"10.1142/s1469026820500108","DOIUrl":"https://doi.org/10.1142/s1469026820500108","url":null,"abstract":"Constraint optimization consists of looking for an optimal solution maximizing a given objective function while meeting a set of constraints. In this study, we propose a new algorithm based on mushroom reproduction for solving constraint optimization problems. Our algorithm, that we call Mushroom Reproduction Optimization (MRO), is inspired by the natural reproduction and growth mechanisms of mushrooms. This process includes the discovery of rich areas with good living conditions allowing spores to grow and develop their own colonies. Given that constraint optimization problems often suffer from a high-time computation cost, we thoroughly assess MRO performance on well-known constrained engineering and real-world problems. The experimental results confirm the high performance of MRO, comparing to other known metaheursitcs, in dealing with complex optimization problems.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127651344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s1469026820500157
F. Shahabi, F. Poorahangaryan, Seyyed Ahmad Edalatpanah, H. Beheshti
Image segmentation is one of the fundamental problems in the image processing, which identifies the objects and other structures in the image. One of the widely used methods for image segmentation is image thresholding that can separate pixels based on the specified thresholds. Otsu method calculates the thresholds to divide two or multiple classes based on between-class variance maximization and within-class variance minimization. However, increasing the number of thresholds, surging the computational time of the segmentation. To combat this drawback, the combination of Otsu and the evolutionary algorithm is usually beneficial. Crow Search Algorithm (CSA) is a novel, and efficient swarm-based metaheuristic algorithm that inspired from the way crows storing and retrieving food. In this paper, we proposed a hybrid method based on employing CSA and Otsu for multilevel thresholding. The obtained results compared with the combination of the Otsu method with three other evolutionary algorithms consisting of improved Particle Swarm Optimization (PSO), Firefly Algorithm (FA), and also the fuzzy version of FA. Our evaluation on the five benchmark images shows competitive/improved results both in time and uniformity.
{"title":"A Multilevel Image Thresholding Approach Based on Crow Search Algorithm and Otsu Method","authors":"F. Shahabi, F. Poorahangaryan, Seyyed Ahmad Edalatpanah, H. Beheshti","doi":"10.1142/s1469026820500157","DOIUrl":"https://doi.org/10.1142/s1469026820500157","url":null,"abstract":"Image segmentation is one of the fundamental problems in the image processing, which identifies the objects and other structures in the image. One of the widely used methods for image segmentation is image thresholding that can separate pixels based on the specified thresholds. Otsu method calculates the thresholds to divide two or multiple classes based on between-class variance maximization and within-class variance minimization. However, increasing the number of thresholds, surging the computational time of the segmentation. To combat this drawback, the combination of Otsu and the evolutionary algorithm is usually beneficial. Crow Search Algorithm (CSA) is a novel, and efficient swarm-based metaheuristic algorithm that inspired from the way crows storing and retrieving food. In this paper, we proposed a hybrid method based on employing CSA and Otsu for multilevel thresholding. The obtained results compared with the combination of the Otsu method with three other evolutionary algorithms consisting of improved Particle Swarm Optimization (PSO), Firefly Algorithm (FA), and also the fuzzy version of FA. Our evaluation on the five benchmark images shows competitive/improved results both in time and uniformity.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130974493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s1469026820500133
S. Gharghory
An enhanced architecture of recurrent neural network based on Long Short-Term Memory (LSTM) is suggested in this paper for predicting the microclimate inside the greenhouse through its time series data. The microclimate inside the greenhouse largely affected by the external weather variations and it has a great impact on the greenhouse crops and its production. Therefore, it is a massive importance to predict the microclimate inside greenhouse as a preceding stage for accurate design of a control system that could fulfill the requirements of suitable environment for the plants and crop managing. The LSTM network is trained and tested by the temperatures and relative humidity data measured inside the greenhouse utilizing the mathematical greenhouse model with the outside weather data over 27 days. To evaluate the prediction accuracy of the suggested LSTM network, different measurements, such as Root Mean Square Error (RMSE) and Mean Absolute Error (MAE), are calculated and compared to those of conventional networks in references. The simulation results of LSTM network for forecasting the temperature and relative humidity inside greenhouse outperform over those of the traditional methods. The prediction results of temperature and humidity inside greenhouse in terms of RMSE approximately are 0.16 and 0.62 and in terms of MAE are 0.11 and 0.4, respectively, for both of them.
{"title":"Deep Network based on Long Short-Term Memory for Time Series Prediction of Microclimate Data inside the Greenhouse","authors":"S. Gharghory","doi":"10.1142/s1469026820500133","DOIUrl":"https://doi.org/10.1142/s1469026820500133","url":null,"abstract":"An enhanced architecture of recurrent neural network based on Long Short-Term Memory (LSTM) is suggested in this paper for predicting the microclimate inside the greenhouse through its time series data. The microclimate inside the greenhouse largely affected by the external weather variations and it has a great impact on the greenhouse crops and its production. Therefore, it is a massive importance to predict the microclimate inside greenhouse as a preceding stage for accurate design of a control system that could fulfill the requirements of suitable environment for the plants and crop managing. The LSTM network is trained and tested by the temperatures and relative humidity data measured inside the greenhouse utilizing the mathematical greenhouse model with the outside weather data over 27 days. To evaluate the prediction accuracy of the suggested LSTM network, different measurements, such as Root Mean Square Error (RMSE) and Mean Absolute Error (MAE), are calculated and compared to those of conventional networks in references. The simulation results of LSTM network for forecasting the temperature and relative humidity inside greenhouse outperform over those of the traditional methods. The prediction results of temperature and humidity inside greenhouse in terms of RMSE approximately are 0.16 and 0.62 and in terms of MAE are 0.11 and 0.4, respectively, for both of them.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114282004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s1469026820500169
Shideh Saraeian, Mahya Mohammadi Golchi
Comprehensive development of computer networks causes the increment of Distributed Denial of Service (DDoS) attacks. These types of attacks can easily restrict communication and computing. Among all the previous researches, the accuracy of the attack detection has not been properly addressed. In this study, deep learning technique is used in a hybrid network-based Intrusion Detection System (IDS) to detect intrusion on network. The performance of the proposed technique is evaluated on the NSL-KDD and ISCXIDS 2012 datasets. We performed traffic visual analysis using Wireshark tool and did some experimentations to prove the superiority of the proposed method. The results have shown that our proposed method achieved higher accuracy in comparison with other useful machine learning techniques.
{"title":"Application of Deep Learning Technique in an Intrusion Detection System","authors":"Shideh Saraeian, Mahya Mohammadi Golchi","doi":"10.1142/s1469026820500169","DOIUrl":"https://doi.org/10.1142/s1469026820500169","url":null,"abstract":"Comprehensive development of computer networks causes the increment of Distributed Denial of Service (DDoS) attacks. These types of attacks can easily restrict communication and computing. Among all the previous researches, the accuracy of the attack detection has not been properly addressed. In this study, deep learning technique is used in a hybrid network-based Intrusion Detection System (IDS) to detect intrusion on network. The performance of the proposed technique is evaluated on the NSL-KDD and ISCXIDS 2012 datasets. We performed traffic visual analysis using Wireshark tool and did some experimentations to prove the superiority of the proposed method. The results have shown that our proposed method achieved higher accuracy in comparison with other useful machine learning techniques.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134526560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s1469026820500170
Nghiem Van Tinh
Over the past 25 years, numerous fuzzy time series forecasting models have been proposed to deal the complex and uncertain problems. The main factors that affect the forecasting results of these models are partition universe of discourse, creation of fuzzy relationship groups and defuzzification of forecasting output values. So, this study presents a hybrid fuzzy time series forecasting model combined particle swarm optimization (PSO) and fuzzy C-means clustering (FCM) for solving issues above. The FCM clustering is used to divide the historical data into initial intervals with unequal size. After generating interval, the historical data is fuzzified into fuzzy sets with the aim to serve for establishing fuzzy relationship groups according to chronological order. Then the information obtained from the fuzzy relationship groups can be used to calculate forecasted value based on a new defuzzification technique. In addition, in order to enhance forecasting accuracy, the PSO algorithm is used for finding optimum interval lengths in the universe of discourse. The proposed model is applied to forecast three well-known numerical datasets (enrolments data of the University of Alabama, the Taiwan futures exchange —TAIFEX data and yearly deaths in car road accidents in Belgium). These datasets are also examined by using some other forecasting models available in the literature. The forecasting results obtained from the proposed model are compared to those produced by the other models. It is observed that the proposed model achieves higher forecasting accuracy than its counterparts for both first—order and high—order fuzzy logical relationship.
{"title":"Enhanced Forecasting Accuracy of Fuzzy Time Series Model Based on Combined Fuzzy C-Mean Clustering with Particle Swam Optimization","authors":"Nghiem Van Tinh","doi":"10.1142/s1469026820500170","DOIUrl":"https://doi.org/10.1142/s1469026820500170","url":null,"abstract":"Over the past 25 years, numerous fuzzy time series forecasting models have been proposed to deal the complex and uncertain problems. The main factors that affect the forecasting results of these models are partition universe of discourse, creation of fuzzy relationship groups and defuzzification of forecasting output values. So, this study presents a hybrid fuzzy time series forecasting model combined particle swarm optimization (PSO) and fuzzy C-means clustering (FCM) for solving issues above. The FCM clustering is used to divide the historical data into initial intervals with unequal size. After generating interval, the historical data is fuzzified into fuzzy sets with the aim to serve for establishing fuzzy relationship groups according to chronological order. Then the information obtained from the fuzzy relationship groups can be used to calculate forecasted value based on a new defuzzification technique. In addition, in order to enhance forecasting accuracy, the PSO algorithm is used for finding optimum interval lengths in the universe of discourse. The proposed model is applied to forecast three well-known numerical datasets (enrolments data of the University of Alabama, the Taiwan futures exchange —TAIFEX data and yearly deaths in car road accidents in Belgium). These datasets are also examined by using some other forecasting models available in the literature. The forecasting results obtained from the proposed model are compared to those produced by the other models. It is observed that the proposed model achieves higher forecasting accuracy than its counterparts for both first—order and high—order fuzzy logical relationship.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131546021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1142/s1469026820500121
Udoinyang G. Inyang, E. E. Akpan, O. C. Akinyokun
Communities globally experience devastating effects, high monetary loss and loss of lives due to incidents of flood and other hazards. Inadequate information and awareness of flood hazard make the management of flood risks arduous and challenging. This paper proposes a hybridized analytic approach via unsupervised and supervised learning methodologies, for the discovery of pieces of knowledge, clustering and prediction of flood severity levels (FSL). A two-staged unsupervised learning based on [Formula: see text]-means and self-organizing maps (SOM) was performed on the unlabeled flood dataset. [Formula: see text]-means based on silhouette criterion discovered top three representatives of the optimal numbers of clusters inherent in the flood dataset. Experts’ judgment favored four clusters, while Squared Euclidean distance was the best performing distance measure. SOM provided cluster visuals of the input attributes within the four different groups and transformed the dataset into a labeled one. A 5-layered Adaptive Neuro Fuzzy Inference System (ANFIS) driven by hybrid learning algorithm was applied to classify and predict FSL. ANFIS optimized by Genetic Algorithm (GA) produced root mean squared error (RMSE) of 0.323 and Error Standard Deviation of 0.408 while Particle Swarm Optimized ANFIS model produced 0.288 as the RMSE, depicting 11% improvement when compared with GA optimized model. The result shows significant improvement in the classification and prediction of flood risks using single ML tool.
{"title":"A Hybrid Machine Learning Approach for Flood Risk Assessment and Classification","authors":"Udoinyang G. Inyang, E. E. Akpan, O. C. Akinyokun","doi":"10.1142/s1469026820500121","DOIUrl":"https://doi.org/10.1142/s1469026820500121","url":null,"abstract":"Communities globally experience devastating effects, high monetary loss and loss of lives due to incidents of flood and other hazards. Inadequate information and awareness of flood hazard make the management of flood risks arduous and challenging. This paper proposes a hybridized analytic approach via unsupervised and supervised learning methodologies, for the discovery of pieces of knowledge, clustering and prediction of flood severity levels (FSL). A two-staged unsupervised learning based on [Formula: see text]-means and self-organizing maps (SOM) was performed on the unlabeled flood dataset. [Formula: see text]-means based on silhouette criterion discovered top three representatives of the optimal numbers of clusters inherent in the flood dataset. Experts’ judgment favored four clusters, while Squared Euclidean distance was the best performing distance measure. SOM provided cluster visuals of the input attributes within the four different groups and transformed the dataset into a labeled one. A 5-layered Adaptive Neuro Fuzzy Inference System (ANFIS) driven by hybrid learning algorithm was applied to classify and predict FSL. ANFIS optimized by Genetic Algorithm (GA) produced root mean squared error (RMSE) of 0.323 and Error Standard Deviation of 0.408 while Particle Swarm Optimized ANFIS model produced 0.288 as the RMSE, depicting 11% improvement when compared with GA optimized model. The result shows significant improvement in the classification and prediction of flood risks using single ML tool.","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132740337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-05-04DOI: 10.1142/s1469026820500054
Sonia Chhabra, Harvir Singh
Estimation of software cost and effort is of prime importance in software development process. Accurate and reliable estimation plays a vital role in successful completion of the project. To estima...
{"title":"Optimizing Design of Fuzzy Model for Software Cost Estimation Using Particle Swarm Optimization Algorithm","authors":"Sonia Chhabra, Harvir Singh","doi":"10.1142/s1469026820500054","DOIUrl":"https://doi.org/10.1142/s1469026820500054","url":null,"abstract":"Estimation of software cost and effort is of prime importance in software development process. Accurate and reliable estimation plays a vital role in successful completion of the project. To estima...","PeriodicalId":422521,"journal":{"name":"Int. J. Comput. Intell. Appl.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130565518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：