Netinfo Security ›› 2017, Vol. 17 ›› Issue (9): 138-142.doi: 10.3969/j.issn.1671-1122.2017.09.032

• Orginal Article • Previous Articles     Next Articles

Overlapping Community Detection Algorithm Based on Improved MCMC Method

Shunshun FU, Yijun GU(), Dahan ZHANG, Fanpeng MENG   

  1. College of Information Technology and Network Security, People’s Public Security University of China, Beijing 100038, China
  • Received:2017-08-01 Online:2017-09-20 Published:2020-05-12

Abstract:

This paper analyzes the characteristics and mechanism of the overlapping community detection algorithm based on Community-Affiliation Graph Model AGM. The aim of this paper is to improve the partial optimization problem .In the original MCMC sampling method, the simulated annealing (ST) strategy and the supplementary search process were introduced to realize the fast updating of the parameters to be obtained and to approximate the global optimal solution. Experiments in four networks show that the results of the improved algorithm are improved compared with the original algorithm, and the experimental results in the DBLP scientific co-network with higher average clustering coefficient are improved by 14%. The improved algorithm can improve the efficiency of sampling and improve the accuracy and reliability of community detection.

Key words: complex network, overlapping community, MCMC method, maximal likelihood

CLC Number: