Experiments on density-constrained graph clustering

Proceedings of the Workshop on Algorithm Engineering and Experiments

Volumn , Issue , 2012, Pages 1-15

  Gorke, Robert ^a   Schumm, Andrea ^a   Wagner, Dorothea ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

DENSE SUB-GRAPHS; EXPERIMENTAL EVALUATION; GRAPH CLUSTERING; GREEDY STRATEGIES; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; QUALITATIVE BEHAVIOR; REFERENCE ALGORITHM;

CLUSTERING ALGORITHMS;

EID: 84879836079     PISSN: 21640300     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972924.1     Document Type: Conference Paper

References (24)

1. Boost C++ Libraries, http://www.boost.org/
2. Arenas, A.: Network data sets, http://deim.urv.cat/~aarenas/data/welcome. htm
3. Berkhin, P.: A Survey of Clustering Data Mining Techniques. In: Kogan, J., Nicholas, C., Teboulle, M. (Eds.) Grouping Multidimensional Data: Recent Advances in Clustering, pp. 25-71. Springer (2006), http://www.springerlink.com/ content/x321256p66512121/
4. Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008(10) (2008), http://dx.doi.org/10.1088/1742-5468/2008/10/P10008
5. Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03). Lecture Notes in Computer Science, Vol. 2832, pp. 568-579. Springer (2003), http://www.springerlink.com/openurl.asp?genre=article&issn=0302- 9743&volume=2832&spage=568
6. Brandes, U., Gaertler, M., Wagner, D.: Engineering Graph Clustering: Models and Experimental Evaluation. ACM Journal of Experimental Algorithmics 12(1.1), 1-26 (2007), http://portal.acm.org/citation.cfm?id=1227161.1227162
7. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70(066111) (2004), http://link.aps.org/ abstract/PRE/v70/e066111
8. Delling, D., Gaertler, M., Görke, R., Wagner, D.: Engineering Comparators for Graph Clusterings. In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08). Lecture Notes in Computer Science, Vol. 5034, pp. 131-142. Springer (June 2008)
9. van Dongen, S.M.: Graph Clustering by Flow Simulation. Ph. D. thesis, University of Utrecht (2000), http://micans.org/mcl/lit/
10. Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees. Internet Mathematics 1(4), 385-408 (2004), http://www.internetmathematics.org/volumes/1.htm
11. Fortunato, S.: Community detection in graphs. Physics Reports 486(3-5), 75-174 (2010), http://www.sciencedirect.com/science/journal/03701573
12. Fortunato, S., Barthélemy, M.: Resolution limit in community detection. Proceedings of the National Academy of Science of the United States of America 104(1), 36-41 (2007), http://www.pnas.org/content/104/1/36.full.pdf
13. Görke, R., Schumm, A., Wagner, D.: Density-Constrained Graph Clustering. In: Dehne, F., Iacono, J., Sack, J.R. (Eds.) Algorithms and Data Structures, 12th International Symposium (WADS'11). Lecture Notes in Computer Science, Vol. 6844. Springer (August 2011)
14. Görke, R., Schumm, A., Wagner, D.: Experiments on Density-Constrained Graph Clustering (December 2011), http://arxiv.org/abs/1112. 2143v1, arXiv report
15. Görke, R., Staudt, C.: A Generator for Dynamic Clustered Random Graphs. Tech. rep., ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH) (2009), http://i11www.iti.uni-karlsruhe.de/projects/spp1307/ dyngen, informatik, Uni Karlsruhe, TR 2009-7
16. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bulletin of the American Mathematical Society 43, 439-561 (2006)
17. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall (1988)
18. Kannan, R., Vempala, S., Vetta, A.: On Clusterings-Good, Bad and Spectral. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00). pp. 367-378 (2000)
19. Lancichinetti, A., Fortunato, S.: Community detection algorithms: A comparative analysis. Physical Review E 80(5) (November 2009), http://link.aps.org/doi/10.1103/PhysRevE.80.056117
20. Lusseau, D., Schneider, K., Boisseau, O., Haase, P., Slooten, E., Dawson, S.: The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations. Behavioral Ecology and Sociobiology 54(4), 396-405 (September 2004), http://www.springerlink.com/content/ pepxvj4lu42ur2gw/
21. Newman, M.: Network data, http://www-personal.umich.edu/~mejn/netdata/
22. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(026113), 1-16 (2004), http://link.aps.org/ abstract/PRE/v69/e026113
23. Rotta, R., Noack, A.: Multilevel local search algorithms for modularity clustering. ACM Journal of Experimental Algorithmics 16, 2.3:2.1-2.3:2. (July 2011), http://doi.acm.org/10.1145/1963190.1970376
24. yWorks GmbH: yFiles for Java (2008), http://www.yworks.com/en/products- yfiles-about.html