A cost function for similarity-based hierarchical clustering

DOI10.1145/2897518.2897527zbMath1373.68453arXiv1510.05043OpenAlexW2963737091MaRDI QIDQ5361823

Sanjoy Dasgupta

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.05043

zbMATH Keywords

hierarchical clusteringapproximation algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Related Items (15)

On Dasgupta's hierarchical clustering objective and its relation to other graph parameters ⋮ Order preserving hierarchical agglomerative clustering ⋮ Hierarchy cost of hierarchical clusterings ⋮ Optimal hierarchical clustering on a graph ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Tangles and Hierarchical Clustering ⋮ Expanding the class of global objective functions for dissimilarity-based hierarchical clustering ⋮ New algorithms for a simple measure of network partitioning ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ New algorithms for a simple measure of network partitioning ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints ⋮ Ultrametric fitting by gradient descent ^* ⋮ End-to-end similarity learning and hierarchical clustering for unfixed size datasets

This page was built for publication: A cost function for similarity-based hierarchical clustering