Search Results

Documents authored by Kuntze, Daniel


Document
Analysis of Agglomerative Clustering

Authors: Marcel R. Ackermann, Johannes Bloemer, Daniel Kuntze, and Christian Sohler

Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)


Abstract
The diameter k-clustering problem is the problem of partitioning a finite subset of R^d into k subsets called clusters such that the maximum diameter of the clusters is minimized. One early clustering algorithm that computes a hierarchy of approximate solutions to this problem for all values of k is the agglomerative clustering algorithm with the complete linkage strategy. For decades this algorithm has been widely used by practitioners. However, it is not well studied theoretically. In this paper we analyze the agglomerative complete linkage clustering algorithm. Assuming that the dimension dis a constant, we show that for any k the solution computed by this algorithm is an O(log k)-approximation to the diameter k-clustering problem. Moreover, our analysis does not only hold for the Euclidean distance but for any metric that is based on a norm.

Cite as

Marcel R. Ackermann, Johannes Bloemer, Daniel Kuntze, and Christian Sohler. Analysis of Agglomerative Clustering. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 308-319, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{ackermann_et_al:LIPIcs.STACS.2011.308,
  author =	{Ackermann, Marcel R. and Bloemer, Johannes and Kuntze, Daniel and Sohler, Christian},
  title =	{{Analysis of Agglomerative Clustering}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
  pages =	{308--319},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Schwentick, Thomas and D\"{u}rr, Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.308},
  URN =		{urn:nbn:de:0030-drops-29942},
  doi =		{10.4230/LIPIcs.STACS.2011.308},
  annote =	{Keywords: agglomerative clustering, hierarchical clustering, complete linkage, approximation guarantees}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail