Search

In landslide disaster warning, a variety of monitoring and warning methods are commonly adopted. However, most monitoring and warning methods cannot provide information in advance, and serious losses are often caused when landslides occur. To advance the warning time before a landslide, an innovative advance landslide prediction and warning model based on a stacking fusion algorithm using Baishuihe landslide data is proposed in this paper. The Baishuihe landslide area is characterized by unique soil and is in the Three Gorges region of China, with a subtropical monsoon climate. Based on Baishuihe historical data and real-time monitoring of the landslide state, four warning level thresholds and trigger conditions for each warning level are established. The model effectively integrates the results of multiple prediction and warning submodels to provide predictions and advance warnings through the fusion of two stacking learning layers. The possibility that a risk priority strategy can be used as a substitute for the stacking model is also discussed. Finally, an experimental simulation verifies that the proposed improved model can not only provide advance landslide warning but also effectively reduce the frequency of false warnings and mitigate the issues of traditional single models. The stacking model can effectively support disaster prevention and reduction and provide a scientific basis for land use management. [ABSTRACT FROM AUTHOR]

Identifying vital nodes in complex networks is of paramount importance in understanding and controlling the spreading dynamics. Currently, this study is facing great challenges in dealing with big data in many real-life applications. With the deepening of the research, scholars began to realize that the analysis on traditional graph model is insufficient because many nodes in a multilayer network share connections among different layers. To address this problem both efficiently and effectively, a novel algorithm for identifying vital nodes in both monolayer and multilayer networks is proposed in this paper. Firstly, a node influence measure is employed to determine the initial leader of a local community. Subsequently, the community structures are revealed via the Maximum Influential Neighbors Expansion (MINE) strategy. Afterward, the communities are regarded as super-nodes for an iteratively folding process till convergence, in order to identify influencers hierarchically. Numerical experiments on 32 real-world datasets are conducted to verify the performance of the proposed algorithm, which shows superiority to the competitors. Furthermore, we apply the proposed algorithm in the graph of adjacencies derived from the maps of China and USA. The comparison and analysis of the identified provinces (or states) suggest that the proposed algorithm is feasible and reasonable on real-life applications. [ABSTRACT FROM AUTHOR]