An influence maximisation algorithm based on community detection

Influence maximisation is an important research direction in social networks. The main goal of this approach is to select seed nodes in the network to maximise the propagated influence. Because the influence maximisation is an NP-hard problem, existing studies have provided approximate solutions, and the research focuses on the framework of greed, but the time complexity of the greedy algorithm is high. In this study, an influence maximisation algorithm based on community detection is proposed. This algorithm uses the K-means algorithm to divide the community. According to the modularity, the optimal community segmentation result is selected. By calculating the edge betweenness of each community, some nodes are selected as important nodes. The important nodes of each community constitute the set of seed nodes used in the influence maximisation algorithm. Experiments show that the algorithm not only has an improved influence, but also the time complexity is effectively reduced.