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...
Saved in:
Main Authors | , |
---|---|
Format | Journal Article |
Language | English |
Published |
29.09.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!