An influence maximisation algorithm based on community detection
by Yan Yuan; Bolun Chen; Yongtao Yu; Ying Jin
International Journal of Computational Science and Engineering (IJCSE), Vol. 22, No. 1, 2020

Abstract: 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.

Online publication date: Mon, 11-May-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email