Susceptibility wildfire assessment in Bolivia (Santa Cruz): an approach based on Random Forest ensemble learning algorithm 

Author(s):  
Marj Tonini ◽  
Marcela Bustillo Sanchez ◽  
Anna Mapelli ◽  
Paolo Fiorucci

<p>The central South American forest is one of the area most affected by wildfires in the world. Because of climate changes and land use management, these events are becoming more frequent and extended in the last years. For example, in 2019 Bolivia faced an extremely extensive wildfire event that had a serious ecological impact in the department of Santa Cruz. This region, called Chiquitania and characterized by a mosaic where wet tropical forests, dry tropical forests and savannas alternate, accounts for more than two-thirds of the total wildfires in the country. Despite Bolivia is between the top-ten countries with the highest expected risk in terms of annual burned forest area, the literature on wildfires here is quite limited, also because of the scarcity of available data and resources. To fill this gap, as part of the present study, we implemented an accurate dataset of burned areas, based on MODIS wildfire product, occurred in the entire Santa Cruz region in the period 2010-2019. Predisposing factors, such as topography, land use and ecoregions, were also collected in the form of digital spatial data. This information allowed assessing the susceptibility to wildfires on the entire region, with a special focus on the municipality of San Ignacio de Velasco. The analysis was performed using Random Forest (RF), an ensemble-learning algorithm based on decision trees, capable of learning from and make predictions on data by modeling the hidden relationships between a set of input and output variables. The goodness of fit was estimated by the area under the ROC (receiver operating characteristic) curve (AUC), selecting the validation dataset by using a 5-folds cross validation procedure. In addition, the last three years of observed burned areas were kept out during the medialization stage and used to test if the implemented model gives good predictions on new data. As result, we obtained a probabilistic output from RF indicating the probability for an area to burn in the future, which allowed elaborating the susceptibility maps. For San Ignacio de Velasco it resulted an AUC of 0.8, while for the entire Santa Cruz the AUC was of 0.73. Likewise, the predictive capabilities of the model gave quite good results, better at municipality that at regional level. The detailed investigation of the relative importance of each categorical class belonging to the variables ecoregions and land use reveals that “Flooded savanna” and “Shrub or herbaceous cover, flooded, fresh/saline/brakish water” are respectively the classes most related with wildfires. This important outcome confirms recent findings, that seasonally wet and dry climate, coupled with hydrologic controls on the vegetation, create in this ecoregion favorable conditions to the ignition and spreading of large wildfires during the driest period, when the biomass is abundant. The occurrence of large fires, initiated by slash-and-burn practice getting out of control, is predicted to increase in the near future and the development of new tools for fire risk assessment and reduction is thus needed. </p>

2021 ◽  
Author(s):  
Yu Tang ◽  
Qi Dai ◽  
Mengyuan Yang ◽  
Lifang Chen

Abstract For the traditional ensemble learning algorithm of software defect prediction, the base predictor exists the problem that too many parameters are difficult to optimize, resulting in the optimized performance of the model unable to be obtained. An ensemble learning algorithm for software defect prediction that is proposed by using the improved sparrow search algorithm to optimize the extreme learning machine, which divided into three parts. Firstly, the improved sparrow search algorithm (ISSA) is proposed to improve the optimization ability and convergence speed, and the performance of the improved sparrow search algorithm is tested by using eight benchmark test functions. Secondly, ISSA is used to optimize extreme learning machine (ISSA-ELM) to improve the prediction ability. Finally, the optimized ensemble learning algorithm (ISSA-ELM-Bagging) is presented in the Bagging algorithm which improve the prediction performance of ELM in software defect datasets. Experiments are carried out in six groups of software defect datasets. The experimental results show that ISSA-ELM-Bagging ensemble learning algorithm is significantly better than the other four comparison algorithms under the six evaluation indexes of Precision, Recall, F-measure, MCC, Accuracy and G-mean, which has better stability and generalization ability.


2013 ◽  
Vol 22 (04) ◽  
pp. 1350025 ◽  
Author(s):  
BYUNGWOO LEE ◽  
SUNGHA CHOI ◽  
BYONGHWA OH ◽  
JIHOON YANG ◽  
SUNGYONG PARK

We present a new ensemble learning method that employs a set of regional classifiers, each of which learns to handle a subset of the training data. We split the training data and generate classifiers for different regions in the feature space. When classifying an instance, we apply a weighted voting scheme among the classifiers that include the instance in their region. We used 11 datasets to compare the performance of our new ensemble method with that of single classifiers as well as other ensemble methods such as RBE, bagging and Adaboost. As a result, we found that the performance of our method is comparable to that of Adaboost and bagging when the base learner is C4.5. In the remaining cases, our method outperformed other approaches.


2019 ◽  
Vol 23 (1) ◽  
pp. 395-406 ◽  
Author(s):  
Yanyun Tao ◽  
Yenming J. Chen ◽  
Xiangyu Fu ◽  
Bin Jiang ◽  
Yuzhen Zhang

2018 ◽  
Vol 173 ◽  
pp. 03004
Author(s):  
Gui-fang Shen ◽  
Yi-Wen Zhang

To improve the accuracy of the financial early warning of the company, aiming at defects of slow learning speed, trapped in local solution and inaccurate operating result of the traditional BP neural network with random initial weights and thresholds, a parallel ensemble learning algorithm based on improved harmony search algorithm using good point set (GIHS) optimize the BP_Adaboost is proposed. Firstly, the good-point set is used to construct a more high quality initial harmony library, and it adjusts the parameters dynamically during the search process and generates several solutions in each iteration so as to make full use of information of harmony memory to improve the global search ability and convergence speed of algorithm. Secondly, ten financial indicators are chosen as the inputs of BP neural network value, and GIHS algorithm and BP neural network are combined to construct the parallel ensemble learning algorithm to optimize BP neural network initial weights value and output threshold value. Finally, many of these weak classifier is composed as strong classifier through the AdaBoost algorithm. The improved algorithm is validated in the company's financial early warning. Simulation results show that the performance of GIHS algorithm is better than the basic HS and IHS algorithm, and the GIHS-BP_AdaBoost classifier has higher classification and prediction accuracy.


2019 ◽  
Vol 9 (15) ◽  
pp. 3143 ◽  
Author(s):  
Lu Han ◽  
Chongchong Yu ◽  
Cuiling Liu ◽  
Yong Qin ◽  
Shijie Cui

The rolling bearing is a key component of the bogie of the rail train. The working environment is complex, and it is easy to cause cracks and other faults. Effective rolling bearing fault diagnosis can provide an important guarantee for the safe operation of the track while improving the resource utilization of the rolling bearing and greatly reducing the cost of operation. Aiming at the problem that the characteristics of the vibration data of the rolling bearing components of the railway train and the vibration mechanism model are difficult to establish, a method for long-term faults diagnosis of the rolling bearing of rail trains based on Exponential Smoothing Predictive Segmentation and Improved Ensemble Learning Algorithm is proposed. Firstly, the sliding time window segmentation algorithm of exponential smoothing is used to segment the rolling bearing vibration data, and then the segmentation points are used to construct the localized features of the data. Finally, an Improved AdaBoost Algorithm (IAA) is proposed to enhance the anti-noise ability. IAA, Back Propagation (BP) neural network, Support Vector Machine (SVM), and AdaBoost are used to classify the same dataset, and the evaluation indexes show that the IAA has the best classification effect. The article selects the raw data of the bearing experiment platform provided by the State Key Laboratory of Rail Traffic Control and Safety of Beijing Jiaotong University and the standard dataset of the American Case Western Reserve University for the experiment. Theoretical analysis and experimental results show the effectiveness and practicability of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document