Online community detection for large complex networks

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 1903-1909

  Zhang, Wangsheng ^a   Pan, Gang ^a   Wu, Zhaohui ^a   Li, Shijian ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GENERATIVE MECHANISM; INTERNAL STRUCTURE; LINEAR TIME COMPLEXITY; ON-LINE COMMUNITIES; PROCESS NETWORKS; REAL-WORLD NETWORKS; SERIAL FASHION; SPLIT MECHANISMS;

ARTIFICIAL INTELLIGENCE; ONLINE SYSTEMS;

POPULATION DYNAMICS;

EID: 84896061771     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Y.Y. Ahn, J.P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466(7307):761-764, 2010.
2. R. Albert and A.L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47, 2002.
3. A.L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
4. A. Barrat, M. Barthelemy, R. Pastor- Satorras, and A. Vespignani. The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11):3747-3752, 2004.
5. Stefano Boccaletti, Vito Latora, Yamir Moreno, Martin Chavez, and D-U Hwang. Complex networks: structure and dynamics. Physics Reports, 424(4):175-308, 2006.
6. U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Transactions on Knowledge and Data Engineering, 20(2):172-188, 2008.
7. E.Y.K. Chan and D.Y. Yeung. A convex formulation of modularity maximization for community detection. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pages 2218-2225. AAAI Press, 2011.
8. Jiyang Chen, Osmar R. Za?iane, and Randy Goebel. Detecting communities in social networks using max-min modularity. In SDM, pages 978-989, 2009.
9. W. Chen, Z. Liu, X. Sun, and Y. Wang. Community detection in social networks through community formation games. In Proceedings of the Twenty- Second International Joint Conference on Artificial Intelligence, pages 2576-2581. AAAI Press, 2011.
10. A. Clauset, M.E.J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):066111, 2004.
11. S. Fortunato and M. Barthelemy. Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1):36-41, 2007.
12. B.H. Good, Y.A. de Montjoye, and A. Clauset. Performance of modularity maximization in practical contexts. Physical Review E, 81(4):046106, 2010.
13. A. Lancichinetti and S. Fortunato. Community detection algorithms: a comparative analysis. Physical Review E, 80(5):056117, 2009.
14. E.A. Leicht and M.E.J. Newman. Community structure in directed networks. Physical Review Letters, 100(11):118703, 2008.
15. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proceedings of the eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pages 177-187. ACM, 2005.
16. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1):2, 2007.
17. 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):29-123, 2009.
18. Jure Leskovec, Kevin J Lang, and Michael Mahoney. Empirical comparison of algorithms for network community detection. In Proceedings of the Nineteenth International Conference on World Wide Web, pages 631-640. ACM, 2010.
19. W. Li and D. Schuurmans. Modular community detection in networks. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pages 1366-1371. AAAI Press, 2011.
20. M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Internet Mathematics, 1(2):226-251, 2004.
21. M.E.J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
22. M.E.J. Newman. Analysis of weighted networks. Physical Review E, 70(5):056131, 2004.
23. M.E.J. Newman. Detecting community structure in networks. The European Physical Journal BCondensed Matter and Complex Systems, 38(2):321-330, 2004.
24. M.E.J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577-8582, 2006.
25. C. Ratti, S. Sobolevsky, F. Calabrese, C. Andris, J. Reades, M. Martino, R. Claxton, and S.H. Strogatz. Redrawing the map of great britain from a network of human interactions. PLoS One, 5(12):e14248, 2010.
26. M. Szell, R. Sinatra, G. Petri, S. Thurner, and V. Latora. Understanding mobility in a social petri dish. Scientific Reports, 2, 2012.
27. L. Wu, X. Ying, X. Wu, and Z.H. Zhou. Line orthogonality in adjacency eigenspace with application to community partition. In Proceedings of the Twenty- Second International Joint Conference on Artificial Intelligence, pages 2349-2354. AAAI Press, 2011.
28. E. Ziv, M. Middendorf, and C.H. Wiggins. Information-theoretic approach to network modularity. Physical Review E, 71(4):046117, 2005.