Hierarchical Clusterings of Unweighted Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2020

Hierarchical Clusterings of Unweighted Graphs

Abstract

We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that takes any such clustering of a graph G and iteratively improves it until a desired target clustering of G is reached. We use this technique to show both a negative and a positive complexity result. Firstly, we show that in general the problem is NP-complete. Secondly, we consider min-well-behaved graphs, which are graphs H having the property that for any k the graph H^{(k)} being the join of k copies of H has an optimal hierarchical clustering that splits each copy of H in the same optimal way. To optimally cluster such a graph H^{(k)} we thus only need to optimally cluster the smaller graph H. Co-bipartite graphs are min-well-behaved, but otherwise they seem to be scarce. We use the normalization procedure to show that also the cycle on 6 vertices is min-well-behaved.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2020-47.pdf (505.16 Ko) Télécharger le fichier

Dates and versions

lirmm-03027532 , version 1 (27-11-2020)

Licence

Attribution

Identifiers

Cite

Svein Hogemo, Christophe Paul, Jan Arne Telle. Hierarchical Clusterings of Unweighted Graphs. MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.47:1-47:13, ⟨10.4230/LIPIcs.MFCS.2020.47⟩. ⟨lirmm-03027532⟩
38 View
24 Download

Altmetric

Share

Gmail Facebook X LinkedIn More