J4 ›› 2012, Vol. 39 ›› Issue (2): 175-180.doi: 10.3969/j.issn.1001-2400.2012.02.029

• Original Articles • Previous Articles     Next Articles

Kernel k-means clustering algorithm for detecting communities  in complex networks based on eigenvector

FU Lidong1,2;GAO Lin1   

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China;
    2. The School of Computer, Xi'an Univ. of Sci. and Tech., Xi'an  710054, China)
  • Received:2010-12-27 Online:2012-04-20 Published:2012-05-21
  • Contact: FU Lidong E-mail:fulidong2005@163.com

Abstract:

To detect the community structure in weighted complex networks, the modularity density function D is generalized to weighted variants(WD) and shows how optimizing the weighted function WD can be formulated as a spectral clustering problem, and a weighted kernel k-means clustering problem. We also prove the equivalence of both clustering approaches based on WD in mathematics. Using the equivalence, we propose a new eigenvector-based kernel clustering algorithm to detect communities in complex networks. Experimental results indicate that it has better performance compared with either the direct kernel k-means algorithm or direct spectral clustering algorithm in terms of quality.

Key words: community structures, modularity density, kernel k-means method, spectral approach, eigenvector-based kernel approach

CLC Number: 

  • A

Baidu
map