A Local Extended Algorithm Combined with Degree and Clustering Coefficient to Optimize Overlapping Community Detection. (29th December 2021)

• Record Type: Journal Article
• Authors: Liu, Jing; Guo, Junfang; Li, Qi
• Other Names: Cheong Siew Ann Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-12-29
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/7428927
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Community structure is one of the most important characteristics of complex networks, which has important applications in sociology, biology, and computer science. The community detection method based on local expansion is one of the most adaptable overlapping community detection algorithms. However, due to the lack of effective seed selection and community optimization methods, the algorithm often gets community results with lower accuracy. In order to solve these problems, we propose a seed selection algorithm of fusion degree and clustering coefficient. The method calculates the weight value corresponding to degree and clustering coefficient by entropy weight method and then calculates the weight factor of nodes as the seed node selection order. Based on the seed selection algorithm, we design a local expansion strategy, which uses the strategy of optimizing adaptive function to expand the community. Finally, community merging and isolated node adjustment strategies are adopted to obtain the final community. Experimental results show that the proposed algorithm can achieve better community partitioning results than other state-of-the-art algorithms.