Abstract The mining of critical nodes has a wide and important potential application in studying network structures and performances. A topology-based critical node mining algorithm is proposed to solve the critical node problem. The algorithm mines the community structure of the network and selects a set of nodes based on topological centrality indicators. Then, this node set and part of the original network are iteratively exchanged to optimize the network connectivity index. At the same time, an improved local search and weighted random selection mechanism are adopted to strengthen the search ability and overcome local optimal traps. In addition, a node centrality indicator based on network topology is proposed to improve the quality of the initial solution. Experiments on multiple synthetic and real network datasets between the proposed algorithm and other advanced algorithms show that the proposed algorithm has better accuracy and robustness.
|
|
|
|
|