Open Access

ARTICLE

Seed-Oriented Local Community Detection Based on Influence Spreading

by Shenglong Wang^1,*, Jing Yang^1,*, Xiaoyu Ding², Jianpei Zhang¹, Meng Zhao¹

1 College of Computer Science and Technology, Harbin Engineering University, Harbin, 150001, China
2 College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China

* Corresponding Authors: Shenglong Wang. Email: ; Jing Yang. Email:

(This article belongs to the Special Issue: Application of Computer Modeling and Simulation in Social Complex System)

Computer Modeling in Engineering & Sciences 2022, 132(1), 215-249. https://doi.org/10.32604/cmes.2022.018050

Received 25 June 2021; Accepted 08 December 2021; Issue published 02 June 2022

Abstract

In recent years, local community detection algorithms have developed rapidly because of their nearly linear computing time and the convenience of obtaining the local information of real-world networks. However, there are still some issues that need to be further studied. First, there is no local community detection algorithm dedicated to detecting a seed-oriented local community, that is, the local community with the seed as the core. The second and third issues are that the quality of local communities detected by the previous local community detection algorithms are largely dependent on the position of the seed and predefined parameters, respectively. To solve the existing problems, we propose a seed-oriented local community detection algorithm, named SOLCD, that is based on influence spreading. First, we propose a novel measure of node influence named k-core centrality that is based on the k-core value of adjacent nodes. Second, we obtain the seed-oriented local community, which is composed of the may-members and the must-member chain of the seed, by detecting the influence scope of the seed. The may-members and the must-members of the seed are determined by judging the influence relationship between the node and the seed. Five state-of-art algorithms are compared to SOLCD on six real-world networks and three groups of artificial networks. The experimental results show that SOLCD can achieve a high-quality seed-oriented local community for various real-world networks and artificial networks with different parameters. In addition, when taking nodes with different influence as seeds, SOLCD can stably obtain high-quality seed-oriented local communities.

---

Keywords

---