Memetic graph clustering
Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.
Download (ext.)
https://doi.org/10.4230/LIPICS.SEA.2018.3
[Published Version]
Conference Paper
| Published
| English
Scopus indexed
Author
Biedermann, Sonja;
Henzinger, MonikaISTA ;
Schulz, Christian;
Schuster, Bernhard
Series Title
LIPIcs
Abstract
It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time.
Publishing Year
Date Published
2018-07-01
Proceedings Title
17th International Symposium on Experimental Algorithms
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume
103
Article Number
3
Conference
SEA: Symposium on Experimental Algorithms
Conference Location
L'Aquila, Italy
Conference Date
2018-07-27 – 2018-07-29
ISBN
ISSN
IST-REx-ID
Cite this
Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3
Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic graph clustering. In 17th International Symposium on Experimental Algorithms (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SEA.2018.3
Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In 17th International Symposium on Experimental Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.SEA.2018.3.
S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103.
Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.
Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Export
Marked PublicationsOpen Data ISTA Research Explorer
Sources
arXiv 1802.07034