A cost function for similarity-based hierarchical clustering
From MaRDI portal
Publication:5361823
DOI10.1145/2897518.2897527zbMath1373.68453arXiv1510.05043MaRDI QIDQ5361823
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
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Unnamed Item, Ultrametric fitting by gradient descent *, New algorithms for a simple measure of network partitioning, Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements, A two-level graph partitioning problem arising in mobile wireless communications, Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints, End-to-end similarity learning and hierarchical clustering for unfixed size datasets, On Dasgupta's hierarchical clustering objective and its relation to other graph parameters, Order preserving hierarchical agglomerative clustering, Hierarchy cost of hierarchical clusterings, New algorithms for a simple measure of network partitioning
