×
Görke, Robert; Kappes, Andrea; Wagner, Dorothea

Experiments on density-constrained graph clustering. (English) Zbl 1347.68310

ACM J. Exp. Algorithm. 19, Spec. Iss. 2, Article No. 3.3, 31 p. (2014).

Cited in 1 Document

MSC:

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
05C85 Graph algorithms (graph-theoretic aspects)

Keywords:

graph clustering; experimental evaluation; quality measures
Cite Review PDF
Full Text: DOI arXiv

References:

[1] Alex Arenas. 2009. Network Data Sets. Retrieved from http://deim.urv.cat/ aarenas/data/welcome.htm.
[2] Alex Arenas, Leon Danon, Albert Díaz-Guilera, Pablo Gleiser, and Roger Guimerà. 2004. Community analysis in social networks. European Physical Journal B 38, 2 (2004), 373-380. · Zbl 1100.68502
[3] Pavel Berkhin. 2006. A survey of clustering data mining techniques. In Grouping Multidimensional Data: Recent Advances in Clustering, Jacob Kogan, Charles Nicholas, and Marc Teboulle (Eds.). Springer, 25-71.
[4] Charles-Edmond Bichot and Patrick Siarry (Eds.). 2011. Graph Partitioning. Wiley. · Zbl 1242.05002
[5] Vincent Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10. · Zbl 1459.91130
[6] Ulrik Brandes, Marco Gaertler, and Dorothea Wagner. 2003. Experiments on graph clustering algorithms. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA’03), Lecture Notes in Computer Science, Vol. 2832. Springer, 568-579. · Zbl 1143.05311
[7] Ulrik Brandes, Marco Gaertler, and Dorothea Wagner. 2007. Engineering graph clustering: Models and experimental evaluation. ACM Journal of Experimental Algorithmics 12, 1.1 (2007), 1-26. · Zbl 1143.05311
[8] Aaron Clauset, Mark E. J. Newman, and Cristopher Moore. 2004. Finding community structure in very large networks. Physical Review E 70, 066111 (2004).
[9] Daniel Delling, Marco Gaertler, Robert Görke, and Dorothea Wagner. 2008. 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, 5034, Springer, 131-142. · Zbl 1143.68502
[10] Gary William Flake, Robert E. Tarjan, and Kostas Tsioutsiouliklis. 2004. Graph clustering and minimum cut trees. Internet Mathematics 1, 4 (2004), 385-408. · Zbl 1098.68095
[11] Santo Fortunato. 2010. Community detection in graphs. Physics Reports 486, 3-5 (2010), 75-174.
[12] Santo Fortunato and Marc Barthélemy. 2007. Resolution limit in community detection. Proceedings of the National Academy of Science of the United States of America 104, 1 (2007), 36-41.
[13] Corrado Gini. 1921. Measurement of inequality of incomes. Economic Journal 31, 121 (March 1921), 124-126.
[14] Robert Görke, Andrea Schumm, and Dorothea Wagner. 2011. Density-constrained graph clustering. In Algorithms and Data Structures, 12th International Symposium (WADS’11), Frank Dehne, John Iacono, and Jörg-Rüdiger Sack (Eds.), Lecture Notes in Computer Science, Vol. 6844. Springer, 679-690. · Zbl 1342.68256
[15] Robert Görke, Andrea Schumm, and Dorothea Wagner. 2012. Experiments on density-constrained graph clustering. In Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX’12). SIAM, 1-15. · Zbl 1430.68291
[16] Robert Görke and Christian Staudt. 2009. A Generator for Dynamic Clustered Random Graphs. Technical Report. iti_wagner. Informatik, Uni Karlsruhe, TR 2009-7.
[17] Shlomo Hoory, Nathan Linial, and Avi Wigderson. 2006. Expander graphs and their applications. Bulletin of the American Mathematical Society 43 (2006), 439-561. · Zbl 1147.68608
[18] Anil K. Jain and Richard C. Dubes. 1988. Algorithms for Clustering Data. Prentice Hall. · Zbl 0665.62061
[19] Ravi Kannan, Santosh Vempala, and Adrian Vetta. 2000. On clusterings—good, bad and spectral. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS’00). 367-378. · Zbl 1192.05160
[20] Andrea Lancichinetti and Santo Fortunato. 2009. Community detection algorithms: A comparative analysis. Physical Review E 80, 5 (November 2009).
[21] David Lusseau, Karsten Schneider, Oliver Boisseau, Patti Haase, Elisabeth Slooten, and Steve Dawson. 2004. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54, 4 (September 2004), 396-405.
[22] Marc Newman. 2011. Network Data. Retrieved from http://www-personal.umich.edu/ mejn/netdata/.
[23] Mark E. J. Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical Review E 69, 026113 (2004), 1-16.
[24] Gergely Palla, Imre Derényi, Illés Farkas, and Tamás Vicsek. 2005. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435 (2005), 814-818.
[25] Randolf Rotta and Andreas Noack. 2011. Multilevel local search algorithms for modularity clustering. ACM Journal of Experimental Algorithmics 16 (July 2011), 2.3:2.1-2.3:2.27. · Zbl 1284.05309
[26] Stijn M. van Dongen. 2000. Graph Clustering by Flow Simulation. Ph.D. dissertation. University of Utrecht. http://micans.org/mcl/lit/.
[27] Stijn M. van Dongen. 2008. Graph clustering via a discrete uncoupling process. SIAM Journal on Matrix Analysis and Applications 30, 1 (2008), 121-141. · Zbl 1161.68041
[28] Ken Wakita and Toshiyuki Tsurumi. 2007. Finding Community Structure in Mega-scale Social Networks. (February 2007). http://arxiv.org/abs/cs/0702048v1 Technical Report on arXiv.
[29] yWorks GmbH. 2008. yFiles for Java. Retrieved from http://www.yworks.com/en/products_yfiles_about.html.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.