Journal on Communications ›› 2015, Vol. 36 ›› Issue (2): 68-79.doi: 10.11959/j.issn.1000-436x.2015035

• Academic papers • Previous Articles     Next Articles

Community detection algorithm based on local affinity propagation and user profile

Kun GUO1,Wen-zhong GUO1,Qi-rong QIU2,Qi-shan ZHANG2   

  1. 1 College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108,China
    2 Management School,Fuzhou University,Fuzhou 350108,China
  • Online:2015-02-25 Published:2017-06-27
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Key Project of Chinese Ministry of Education;The Technology Innovation Platform Project of Fujian Province;The Natural Science Founda-tion of Fujian Province;The Fujian Province High Science Fund for Distinguished Young Scholars;The Program for New Century Excellent Talents in Fujian Province University

Abstract:

An algorithm based on local affinity propagation and a new similarity measure concerning user profile is proposed.On one hand,by loosening the exemplar constraint and requiring the messages propagate around a node's neighbors,the algorithm achieves lower time and space complexity without too much lost in clustering accuracy,which makes it adaptable to the mining of large-scale social networks.On the other hand,by designing a hybrid similarity measure based on the topological similarity and the profile similarity of the nodes,the algorithm can effectively tackle the situation of the social networks data without complete user relation information.The experimental results on the artificial datasets and the real-world datasets demonstrate that the algorithm not only has near-linear time complexity and linear space complexity,but also retains high detecting accuracy when handling incomplete networks.

Key words: social network, affinity propagation, community detection, clustering

No Suggested Reading articles found!