Significance-driven graph clustering

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

Volumn 4508 LNCS, Issue , 2007, Pages 11-26

  Gaertler, Marco ^a   Görke, Robert ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; NETWORK MANAGEMENT; OPTIMIZATION;

COMMUNITY DETECTION; FOUNDING PARADIGMS;

CLUSTERING ALGORITHMS;

EID: 38149006963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72870-2_2     Document Type: Conference Paper

References (22)

1. Gaertler, M.: Clustering. In Brandes, U., Erlebach, T., eds.: Network Analysis: Methodological Foundations. Volume 3418 of Lecture Notes in Computer Science. Springer-Verlag (2005) 178-215
2. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69 (2004)
3. Newman, M.E.J.: A fast algorithm for detecting community structure in networks. Technical report, Department of Physics and Center for the Study of Complex Systems, University of Michigan (2003)
4. Fortunato, S., Barthelemy, M.: Resolution Limit in Community Detection. arXiv.org physics/0607100 (2006)
5. Ziv, E., Middendorf, M., Wiggins, C.: Information-Theoretic Approach to Network Modularity. Phys. Rev. E 71 (2005)
6. Muff, S., Rao, F., Caflisch, A.: Local Modularity Measure for Network Clusterizations. Phys. Rev. E 72 (2005)
7. Fine, P., Paolo, E.D., Philippides, A.: Spatially Constrained Networks and the Evolution of Modular Control Systems. In: 9th Intl. Conference on the Simulation of Adaptive Behavior (SAB). (2006)
8. Newman, M.E.J.: Fast Algorithm for Detecting Community Structure in Networks. Physical Review E 69 (2004)
9. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70 (2004)
10. Newman, M.: Modularity and Community Structure in Networks. In: Proceedings of the National Academy of Sciences. (2005) 8577-8582
11. White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graph. In: SIAM Data Mining Conference. (2005)
12. Guimerà, R., Sales-Pardo, M., Amaral, L.A.N.: Modularity from Fluctuations in Random Graphs and Complex Networks. Physical Review E 70 (2004)
13. Reichardt, J., Bornholdt, S.: Statistical Mechanics of Community Detection. arXiv.org cond-mat/0603718 (2006)
14. Duch, J., Arenas, A.: Community Detection in Complex Networks using Extremal Optimization. Physical Review E 72 (2005)
15. Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: Maximizing modularity is hard, arxiv preprint. http://arxiv. org/ abs/physics/0608255 (2006)
16. van Dongen, S.M.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)
17. Coffin, M., Saltzmann, M.J.: Statistical analysis of computational tests of algorithms and heuristics. 12 (2000)
18. Newman, M.: Analysis of Weighted Networks. Technical report, Cornell University, Santa Fe Institute, University of Michigan (2004)
19. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Technical report, University of New Mexico, University of Michigan (2004)
20. Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: FOCS. (2002) 617-626
21. Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03). Volume 2832 of Lecture Notes in Computer Science. (2003) 568-579
22. Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33 (1977) 452-473