Innovative Landslide Susceptibility Mapping Portrayed by CA-AQD and K-Means Clustering Algorithms

Abstract

This study aims at proposing and designing an improved clustering algorithm for assessing landslide susceptibility using an integration of a Chameleon algorithm and an adaptive quadratic distance (CA-AQD algorithm). It targets improving the prediction capacity of clustering algorithms in landslide susceptibility modelling by overcoming the limitations found in present clustering models, including strong dependence on the initial partition, noise, and outliers as well as difficulties in quantifying the triggering factors (such as rainfall/precipitation). The model was implemented in Baota District, Shaanxi province, China. The CA-AQD algorithm was adopted to split all grids in the study area into many groups with more similar characteristic values, which also owed to efficiently quantifying the uncertain (rainfall) value by using AQD. The K-means algorithm divides these groups into five susceptibility classes according to the values of landslide density in each group. The model was then evaluated using statistical metrics and the performance was validated and compared to that of the traditional Chameleon algorithm and KPSO algorithm. The results show that the CA-AQD algorithm attained the best performance in assessing landslide susceptibility in the study area. Thus, this work adds to the literature by introducing the first empirical integration and application of the CA-AQD algorithm to the assessment of landslides in the study area, which then is a new insight to the field. Also, the method can be helpful for dealing with landslides for better social and economic development.