Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics

Dasgupta recently introduced a cost function for the hierarchical clustering of a set of points given pairwise similarities between them. He showed that this function is NP-hard to optimize, but a top-down recursive partitioning heuristic based on an alpha_n-approximation algorithm for uniform spars...

Full description

Saved in:
Bibliographic Details
Main Authors Charikar, Moses, Chatziafratis, Vaggos
Format Journal Article
LanguageEnglish
Published 29.09.2016
Subjects
Online AccessGet full text

Cover

Loading…