Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees
Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. However, a hierarchical clustering algorithm by Flake et al., which is based on minimum s-t-cuts whose sink sides are of minimum size, yields such a provable guarantee. We introduce a new degree of freedom to this method by allowing arbitrary minimum s-t-cuts and show that this unrestricted algorithm is complete, i.e., any clustering hierarchy based on minimum s-t-cuts can be found by choosing the right cuts. This allows for a more comprehensive analysis of a graph’s structure. Additionally, we present a dynamic version of the unrestricted approach which employs this new degree of freedom to maintain a hierarchy of clusterings fulfilling this quality guarantee and effectively avoid changing the clusterings.
KeywordsDynamic Version Graph Cluster Hierarchical Cluster Algorithm Cluster Hierarchy Quality Guarantee
Unable to display preview. Download preview PDF.
- 2.Brandes, U., Delling, D., Gaertler, M., Görke, R., Höfer, M., Nikoloski, Z., Wagner, D.: On Modularity Clustering. IEEE TKDE 20(2), 172–188 (2008)Google Scholar
- 7.Saha, B., Mitra, P.: Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. In: Proc. of the 2007 SIAM Int. Conf. on Data Mining, pp. 581–586 (2007)Google Scholar
- 9.Doll, C.: Hierarchical Cut Clustering in Dynamic Scenarios. Student Research Project, KIT Karlsruhe Institute of Technology, Department of Informatics (February 2011), http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/studienarbeitchristofdoll.pdf
- 10.Doll, C., Hartmann, T., Wagner, D.: Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. Karlsruhe Reports in Informatics 2011-10, KIT Karlsruhe Institute of Technology (2011)Google Scholar