A Circuits Merging Community Discovery Algorithm Based on Mobile User Behaviors
Xiao Mi Meng Xiang-wu Shi Yan-cui
(Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing 100876, China)
(School of Computer, Beijing University of Posts and Telecommunications, Beijing 100876, China)
Abstract:Due to the characteristics of the mobile device, it is difficult to implement the existing network discovery algorithm based on clique in mobile social network. In order to solve the problem, through analyzing the mobile user behaviors, an algorithm of community discovery algorithm based on circuit merging is proposed. Firstly, the mobile social network is constructed according to the mobile user behaviors. The method finds the k-circuit as community core by using the k-Elementary Circuits (k-EC) finding algorithm. And then the community cores that have common nodes will be merged according to some given rules. Secondly, the remainder discrete nodes are added to elementary communities according to the mobile user correlation degree. Finally, the algorithm is proved more accurate and feasible in the experiments by using the public data sets and the simulated data sets.
肖觅, 孟祥武, 史艳翠. 一种基于移动用户行为的回路融合社区发现算法[J]. 电子与信息学报, 2012, 34(10): 2369-2374.
Xiao Mi, Meng Xiang-Wu, Shi Yan-Cui. A Circuits Merging Community Discovery Algorithm Based on Mobile User Behaviors. , 2012, 34(10): 2369-2374.