On clustering networks with PageRank

Network clustering has attracted increasing attention in various fields. In this paper we build a PageRank based clustering scheme and use it to cluster some classic problems, such as karate club and American college football networks. Compared with other known algorithms, experiments show that our algorithm has a shorter running time and uncovers community structure more successfully.

[1]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[2]  Fan Chung Graham,et al.  Finding and Visualizing Graph Clusters Using PageRank Optimization , 2010, Internet Math..

[3]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[4]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[5]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[6]  Pavel Berkhin,et al.  A Survey on PageRank Computing , 2005, Internet Math..

[7]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[11]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[12]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[13]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).