Static community detection algorithms for evolving networks

WiOpt 2010 - 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Volumn , Issue , 2010, Pages 513-519

  Aynaud, Thomas ^a   Guillaume, Jean Loup ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Blogs; Complex networks; Evolving communities; Stability; Tracking

Indexed keywords

COMMUNITY DETECTION ALGORITHMS; COMPLEX NETWORKS; EDIT DISTANCE; EVOLVING COMMUNITIES; EVOLVING NETWORKS; SUBNETWORKS; TRACKING;

ALGORITHMS; CIRCUIT THEORY; INTERNET; OPTIMIZATION; POPULATION DYNAMICS; SIGNAL DETECTION;

AD HOC NETWORKS;

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

References (19)

1. D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon, "Multiscale visualization of small world networks," in Proc. IEEE Symposium on Information Visualization, vol. pages, 2003, pp. 75-81.
2. A. Schenker, M. Last, H. Bunke, and A. Kandel, "Graph representations for web document clustering," Pattern Recognition and Image Analysis, no. 1, pp. 935-942, 2003.
3. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, no. 2, p. 26113, 2004.
4. U. Brandes, D. Delling, M. Gaertler, R. Goerke, M. Hoefer, Z. Nikoloski, and D. Wagner, "Maximizing Modularity is hard," ArXiv Physics e-prints, 2006.
5. M. A. Porter, P. J. Mucha, and J.-p. Onnela, "Communities in Networks," Notices of the American Mathematical Society, vol. 56-9, 2009.
6. S. E. Schaeffer, "Graph clustering," Computer Science Review, vol. 1, pp. 27-64, 2007.
7. S. Fortunato, "Community detection in graphs," Physics Reports, vol. 486, no. 3-5, pp. 75-174, 2010. [Online]. Available: http://www. sciencedirect.com/science/article/B6TVP-4XPYXF1-1/2/ 99061fac6435db4343b2374d26e64ac1
8. P. Pons and M. Latapy, "Computing communities in large networks using random walks," Journal of Graph Algorithms and Applications, vol. 10, pp. 191-218, 2006.
9. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70066111, 2004.
10. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," J. Stat. Mech, vol. 10008, pp. 1-12, 2008.
11. R. Kumar, A. Tomkins, and D. Chakrabarti, "Evolutionary clustering," in In Proc. of the 12th ACM SIGKDD Conference, 2006.
12. B. L. Tseng, Y.-R. Lin, Y. Chi, S. Zhu, and H. Sundaram, "Analyzing communities and their evolutions in dynamic social networks," ACM Transactions on Knowledge Discovery from Data, vol. 3, no. 2, pp. 1-31, 2009.
13. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, "Tracking evolving communities in large linked networks," in National Academy of Sciences of the United States of America, vol. 101, no. Suppl 1. National Acad Sciences, 2004, p. 5249.
14. M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult, "Monic: modeling and monitoring cluster transitions," in Proceedings of the 12th ACM SIGKDD. ACM New York, NY, USA, 2006, pp. 706-711.
15. G. Palla, A.-L. Barabasi, and T. Vicsek, "Quantifying social group evolution," Nature, vol. 446, pp. 664-667, 2007.
16. D. J. Fenn, M. A. Porter, P. J. Mucha, M. McDonald, S. Williams, N. F. Johnson, and N. S. Jones, "Dynamical Clustering of Exchange Rates," Exchange Organizational Behavior Teaching Journal, no. 21, pp. 1-35, 2009.
17. J. Epps and J. Bailey, "Information Theoretic Measures for Clusterings Comparison: Is a Correction for Chance," in Proceedings of the 26th Annual International Conference on Machine Learning, 2009.
18. H. Kuhn, P. Haas, I. Ilyas, G. Lohman, and V. Markl, "The Hungarian method for the assignment problem," Masthead, vol. 23, no. 3, p. 151210, 1993.
19. M. E. J. Newman, "The structure of scientific collaboration networks." in Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 2, 2000, pp. 404-9.