Modularity-driven clustering of dynamic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6049 LNCS, Issue , 2010, Pages 436-448

  Görke, Robert ^a   Maillard, Pascal ^b   Staudt, Christian ^a   Wagner, Dorothea ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC CHANGES; DYNAMIC GRAPH; DYNAMIC MAINTENANCES; DYNAMIC NETWORK; DYNAMIZATION; EXPERIMENTAL EVALUATION; NP-HARD PROBLEM; ON DYNAMICS; QUALITY INDICES; RANDOM GRAPHS; REAL-WORLD; RECOMPUTATION; SPECIFIC TASKS; STATIC ALGORITHMS; STATIC APPROACH; TIGHT BOUND;

COMPUTATIONAL COMPLEXITY; OPTIMIZATION;

CLUSTERING ALGORITHMS;

EID: 78650632250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_37     Document Type: Conference Paper

References (31)

1. Görke, R., Maillard, P., Staudt, C., Wagner, D.: Modularity-Driven Clustering of Dynamic Graphs. Technical report, Universität Karlsruhe (TH), Informatik, TR 2010-5 (2010).
2. Brandes, U., Delling, D., Gaertler, M., G̈orke, R., Höfer, M., Nikoloski, Z., Wagner, D.: On Modularity Clustering. IEEE TKDE 20(2), 172-188 (2008).
3. Fortunato, S.: Community detection in graphs. Elsevier Phys. R 486(3-5) (2009).
4. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(026113) (2004).
5. Keogh, E., Lonardi, S., Ratanamahatana, C.A.: Towards Parameter-Free Data Mining. In: Proc. of the 10th ACM SIGKDD Int. Conf., pp. 206-215. ACM, New York (2004).
6. Schaeffer, S.E., Marinoni, S., Särelä, M., Nikander, P.: Dynamic Local Clustering for Hierarchical Ad Hoc Networks. In: Proc. of Sensor and Ad Hoc Communications and Networks, vol. 2, pp. 667-672. IEEE, Los Alamitos (2006).
7. Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: The. and Exp. 2008(10).
8. Delling, D., Görke, R., Schulz, C., Wagner, D.: ORCA Reduction and ContrAction Graph Clustering. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol. 5564, pp. 152-165. Springer, Heidelberg (2009).
9. Görke, R., Hartmann, T., Wagner, D.: Dynamic Graph Clustering Using Minimum- Cut Trees. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol. 5664, pp. 339-350. Springer, Heidelberg (2009).
10. Hopcroft, J.E., Khan, O., Kulis, B., Selman, B.: Tracking Evolving Communities in Large Linked Networks. Proceedings of the National Academy of Science of the United States of America 101 (April 2004).
11. Palla, G., Barabási, A.L., Vicsek, T.: Quantifying social group evolution. Nature 446, 664-667 (2007).
12. Aggarwal, C.C., Yu, P.S.: Online Analysis of Community Evolution in Data Streams. In: [31].
13. Sun, J., Yu, P.S., Papadimitriou, S., Faloutsos, C.: GraphScope: Parameter-Free Mining of Large Time-Evolving Graphs. In: Proc. of the 13th ACM SIGKDD Int. Conference, pp. 687-696. ACM Press, New York (2007).
14. Hübner, F.: The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik (May 2008).
15. Chakrabarti, D., Kumar, R., Tomkins, A.S.: Evolutionary Clustering. In: Proc. of the 12th ACM SIGKDD Int. Conference, pp. 554-560. ACM Press, New York (2006).
16. Schaeffer, S.E.: Graph Clustering. Computer Science Review 1(1), 27-64 (2007).
17. White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graphs. In: [31], pp. 274-285.
18. Pons, P., Latapy, M.: Computing Communities in Large Networks Using Random Walks. Journal of Graph Algorithms and Applications 10(2), 191-218 (2006).
19. van Dongen, S.M.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000).
20. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70(066111) (2004).
21. Brandes, U., Erlebach, T. (eds.): Network Analysis: Methodological Foundations. LNCS, vol. 3418. Springer, Heidelberg (2005).
22. Fortunato, S., Barthélemy, M.: Resolution limit in community detection. PNAS 104(1), 36-41 (2007).
23. Newman, M.E.J.: Analysis of Weighted Networks. P. R. E 70(056131), 1-9 (2004).
24. Görke, R., Gaertler, M., Hübner, F., Wagner, D.: Computational Aspects of Lucidity-Driven Graph Clustering. JGAA 14(2) (2010).
25. Delling, D., Gaertler, M., Görke, R., Wagner, D.: Engineering Comparators for Graph Clusterings. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 131-142. Springer, Heidelberg (2008).
26. Noack, A., Rotta, R.: Multi-level Algorithms for Modularity Clustering. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 257-268. Springer, Heidelberg (2009).
27. Görke, R., Staudt, C.: A Generator for Dynamic Clustered Random Graphs. Technical report, Universiẗat Karlsruhe (TH), Informatik, TR 2009-7 (2009).
28. Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 568- 579. Springer, Heidelberg (2003).
29. Guimerà, R., Amaral, L.A.N.: Functional Cartography of Complex Metabolic Networks. Nature 433, 895-900 (2005).
30. Good, B.H., de Montjoye, Y., Clauset, A.: The performance of modularity maximization in practical contexts. arxiv.org/abs/0910.0165 (2009).
31. Proceedings of the fifth SIAM International Conference on Data Mining. SIAM, Philadelphia (2005).