Personalized PageRank Clustering: A graph clustering algorithm based on random walks

Physica A: Statistical Mechanics and its Applications

Volumn 392, Issue 22, 2013, Pages 5772-5785

  Tabrizi, Shayan A ^a   Shakery, Azadeh ^a,b   Asadpour, Masoud ^a,b   Abbasi, Maziar ^a   Tavallaie, Mohammad Ali ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b INSTITUTE FOR RESEARCH IN FUNDAMENTAL SCIENCES IPM   (Iran)

Author keywords

Clustering; Community detection; PageRank; Random walks; Social networks

Indexed keywords

BIOINFORMATICS; COMPLEX NETWORKS; ELECTRIC NETWORK PARAMETERS; GRAPH ALGORITHMS; RANDOM PROCESSES; SOCIAL NETWORKING (ONLINE);

CLUSTERING; CLUSTERING PROBLEMS; COMMUNITY DETECTION; GRAPH CLUSTERING ALGORITHMS; PAGERANK; PERSONALIZED PAGERANK; RANDOM WALK; TOP DOWN APPROACHES;

CLUSTERING ALGORITHMS;

EID: 84883451255     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2013.07.021     Document Type: Article

References (58)

1. V.D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre Fast unfolding of communities in large networks Journal of Statistical Mechanics: Theory and Experiment 10 2008 P10008
2. M. Rosvall, and C.T. Bergstrom Maps of random walks on complex networks reveal community structure Proceedings of the National Academy of Sciences 105 4 2008 1118 1123
3. M. Rosvall, and C.T. Bergstrom Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems PLoS ONE 6 4 2011 e18209
4. S. Fortunato Community detection in graphs Physics Reports 486 3-5 2010 75 174
5. L. Hagen, and A.B. Kahng A new approach to effective circuit clustering Proceedings of the IEEE/ACM International Conference on Computer-Aided Design 1992 422 427
6. D. Harel, and Y. Koren On clustering using random walks Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science 2001 18 41
7. L. Yen, D. Vanvyve, F. Wouters, F. Fouss, M. Verleysen, and M. Saerens Clustering using a random walk based distance measure 13th European Symposium on Artificial Neural Networks 2005 317 324
8. K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S.K. Pham, and E. Smirnova Pagerank based clustering of hypertext document collections Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 2008 873 874
9. A. Azran, and Z. Ghahramani A new approach to data driven clustering Proceedings of the 23rd International Conference on Machine Learning 2006 57 64
10. R. Andersen, F. Chung, and K. Lang Local graph partitioning using PageRank vectors Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science 2006 475 486
11. R. Andersen, F. Chung, and K. Lang Using PageRank to locally partition a graph Internet Mathematics 4 1 2007 35 64
12. R. Andersen, and F. Chung Detecting sharp drops in PageRank and a simplified local partitioning algorithm Proceedings of the 4th International Conference on Theory and Applications of Models of Computation 2007 1 12
13. M. Alamgir, and U. von Luxburg Multi-agent random walks for local clustering on graphs Proceedings of the IEEE International Conference on Data Mining 2010 18 27
14. S. Kale, and C. Seshadhri Combinatorial approximation algorithms for MaxCut using random walks Data Structures and Algorithms 2011 367 388
15. M. Girvan, and M.E.J. Newman Community structure in social and biological networks Proceedings of the National Academy of Sciences 99 12 2002 7821 7826
16. P.G. Sun, and Y. Yang Methods to find community based on edge centrality Physica A: Statistical Mechanics and its Applications 392 9 2013 1977 1988
17. R.M. Karp Reducibility among combinatorial problems Complexity of Computer Computations 1972 Springer 85 103
18. K. Li, X. Gong, S. Guan, and C.-H. Lai Efficient algorithm based on neighborhood overlap for community identification in complex networks Physica A: Statistical Mechanics and its Applications 391 4 2012 1788 1796
19. P. Csermely Weak Links: Stabilizers of Complex Systems from Proteins to Social Networks 2006 Springer
20. L. Danon, A. Daz-Guilera, J. Duch, and A. Arenas Comparing community structure identification Journal of Statistical Mechanics: Theory and Experiment 09 2005 P09008
21. J. Xie, B.K. Szymanski, and X. Liu SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process Proceedings of the IEEE 11th International Conference on Data Mining Workshops 2011 344 349
22. X. Fu, L. Liu, and C. Wang Detection of community overlap according to belief propagation and conflict Physica A: Statistical Mechanics and its Applications 392 4 2013 941 952
23. T.S. Evans, and R. Lambiotte Line graphs, link partitions, and overlapping communities Physical Review E 80 1 2009 016105
24. R. Lambiotte, J.C. Delvenne, M. Barahona, Laplacian dynamics and multiscale modular structure in networks, 2009. http://arxiv.org/abs/0812.1770.
25. J.-C. Delvenne, S.N. Yaliraki, and M. Barahona Stability of graph communities across time scales Proceedings of the National Academy of Sciences 107 29 2010 12755 12760
26. L. Page, S. Brin, R. Motwani, T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, in: Tech. Rep., Stanford Digital Library Technologies Project, 1998.
27. T.H. Haveliwala Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search IEEE Transactions on Knowledge and Data Engineering 15 4 2003 784 796
28. H.L. Anderson Metropolis, Monte Carlo, and the MANIAC Los Alamos Science 14 1986 96 108
29. D. Fogaras, B. Rcz, K. Csalogny, and T. Sarls Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments Internet Mathematics 2 3 2005 333 358
30. M.R. Henzinger, R. Motwani, and C. Silverstein Challenges in web search engines SIGIR Forum 36 2 2002 11 22
31. G. Simmel, and K.H. Wolff The sociology of Georg Simmel Free Press 1950
32. M.E.J. Newman Modularity and community structure in networks Proceedings of the National Academy of Sciences 103 23 2006 8577 8582
33. M.L. Fredman, and R.E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms Journal of ACM 34 3 1987 596 615
34. A. Lancichinetti, S. Fortunato, and F. Radicchi Benchmark graphs for testing community detection algorithms Physical Review E 78 4 2008 046110
35. M. Bastian, S. Heymann, and M. Jacomy Gephi: an open source software for exploring and manipulating netwoberks Proceedings of the 3rd International Conference on Weblogs and Social Media 2009 361 362
36. W. Zachary An information flow model for conflict and fission in small groups Journal of Anthropological Research 33 4 1977 425 473
37. D. Lusseau, K. Schneider, O.J. Boisseau, P. Haase, E. Slooten, and S.M. Dawson The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations Behavioral Ecology and Sociobiology 54 4 2003 396 405
38. D.E. Knuth The Stanford GraphBase: A Platform for Combinatorial Computing 1993 Addison-Wesley
39. V. Krebs, Books about US politics, 1988. http://www.orgnet.com (online; accessed 22.04.12).
40. M.E.J. Newman Finding community structure in networks using the eigenvectors of matrices Physical Review E 74 3 2006 036104
41. L.A. Adamic, and N. Glance The political blogosphere and the 2004 U.S. election: divided they blog Proceedings of the 3rd International Workshop on Link Discovery 2005 36 43
42. I. Xenarios, L. Salwnski, X.J. Duan, P. Higney, S.-M. Kim, and D. Eisenberg DIP, the database of interacting proteins: a research tool for studying cellular networks of protein interactions Nucleic Acids Research 30 1 2002 303 305
43. Cornell KDD Cup, 2003. http://www.cs.cornell.edu/projects/kddcup/ (online; accessed 22.04.12).
44. A. Harpale, Y. Yang, S. Gopal, D. He, and Z. Yue CiteData: a new multi-faceted dataset for evaluating personalized search performance Proceedings of the 19th ACM International Conference on Information and Knowledge Management 2010 549 558
45. R. Albert, H. Jeong, and A.L. Barabasi The diameter of the world wide web Nature 401 1999 130 131
46. J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters Internet Mathematics 6 1 2009 29 123
47. A. Clauset, M.E.J. Newman, and C. Moore Finding community structure in very large networks Physical Review E 70 6 2004 066111
48. P. Pons, and M. Latapy Computing communities in large networks using random walks Journal of Graph Algorithms and Applications 10 2 2006 191 218
49. K. Wakita, and T. Tsurumi Finding community structure in a mega-scale social networking service Proceedings of IADIS International Conference on WWW/Internet 2007 153 162
50. A. Lancichinetti, and S. Fortunato Community detection algorithms: a comparative analysis Physical Review E 80 5 2009 056117
51. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi Defining and identifying communities in networks Proceedings of the National Academy of Sciences 101 9 2004 2658 2663
52. Y. Wang, and D.J. DeWitt Computing PageRank in a distributed internet search system Proceedings of the Thirtieth International Conference on Very Large Data Bases 2004 420 431
53. Y. Zhu, S. Ye, and X. Li Distributed PageRank computation based on iterative aggregation-disaggregation methods Proceedings of the 14th ACM International Conference on Information and Knowledge Management 2005 578 585
54. H. Ishii, and R. Tempo Distributed randomized algorithms for the PageRank computation IEEE Transactions on Automatic Control 55 9 2010 1987 2002
55. G. Malewicz, M.H. Austern, A.J. Bik, J.C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski Pregel: a system for large-scale graph processing Proceedings of the ACM SIGMOD International Conference on Management of data 2010 135 146
56. M. Wang, S. Lim, J. Cong, and M. Sarrafzadeh Multi-way partitioning using bi-partition heuristics Proceedings of the Asia and South Pacific Design Automation Conference 2000 667 672
57. D. Lai, H. Lu, and C. Nardini Enhanced modularity-based community detection by random walk network preprocessing Physical Review E 81 6 2010 066118
58. S. Fortunato, and M. Barthlemy Resolution limit in community detection Proceedings of the National Academy of Sciences 104 1 2007 36 41