A Community Detection Method Based on Local Optimization in Social Networks

Social networks are a kind of communal structure composed of many nodes according to different kinds of relationships. Community detection can help people understand the topology of a network and identify meaningful clusters. A large variety of community detection algorithms have been proposed. However, many of these algorithms are suitable for unweighted networks since they ignore the social properties of the links between nodes. Meanwhile, their discovery results may lead to the emergence of huge communities. Therefore, a weighted method and local community stability for social networks based on LFM is proposed in this article. This WSLFM algorithm uses a weighted method based on the social attributes of the link and the degree of common neighboring nodes to update the fitness function. It also introduces the concept of stability to control the expansion of local communities. The proposed WSLFM algorithm was tested and proved to be effective on a synthetic network and a real-world network for finding smaller and more meaningful clusters.

[1]  Tiejun Lv,et al.  Efficient Vector Influence Clustering Coefficient Based Directed Community Detection Method , 2017, IEEE Access.

[2]  Xiaohua Jia,et al.  Releasing Correlated Trajectories: Towards High Utility and Optimal Differential Privacy , 2020, IEEE Transactions on Dependable and Secure Computing.

[3]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[4]  Gerardo Chowell,et al.  Null Models for Community Detection in Spatially-Embedded, Temporal Networks , 2014, bioRxiv.

[5]  Fergal Reid,et al.  Title Detecting Highly Overlapping Community Structure by Greedy Clique Expansion Detecting Highly Overlapping Community Structure by Greedy Clique Expansion , 2022 .

[6]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Justin Zhijun Zhan,et al.  A Framework for Community Detection in Large Networks Using Game-Theoretic Modeling , 2017, IEEE Transactions on Big Data.

[8]  Xiaodong Lin,et al.  Efficient and Secure Decision Tree Classification for Cloud-Assisted Online Diagnosis Services , 2019, IEEE Transactions on Dependable and Secure Computing.

[9]  Zheng Qin,et al.  A feature-hybrid malware variants detection using CNN based opcode embedding and BPNN based API embedding , 2019, Comput. Secur..

[10]  Yun Liu,et al.  Overlapping Community Detection Using Non-Negative Matrix Factorization With Orthogonal and Sparseness Constraints , 2018, IEEE Access.

[11]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[12]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[13]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[14]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[15]  Jianhua Li,et al.  Overlapping Community Detection Based on Structural Centrality in Complex Networks , 2017, IEEE Access.