A cost function for similarity-based hierarchical clustering

143Citations
Citations of this article
115Readers
Mendeley users who have this article in their library.

Abstract

The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibly in canonical instances and that it admits a top-down construction procedure with a provably good approximation ratio.

Cite

CITATION STYLE

APA

Dasgupta, S. (2016). A cost function for similarity-based hierarchical clustering. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. 19-21-June-2016, pp. 118–127). Association for Computing Machinery. https://doi.org/10.1145/2897518.2897527

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free