A cost function for similarity-based hierarchical clustering

10/16/2015
by   Sanjoy Dasgupta, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2018

A New Cost Function for Hierarchical Cluster Trees

Hierarchical clustering has been a popular method in various data analys...
research
12/06/2018

An Improved Cost Function for Hierarchical Cluster Trees

Hierarchical clustering has been a popular method in various data analys...
research
07/19/2012

Hierarchical Clustering using Randomly Selected Similarities

The problem of hierarchical clustering items from pairwise similarities ...
research
10/25/2021

Shift of Pairwise Similarities for Data Clustering

Several clustering methods (e.g., Normalized Cut and Ratio Cut) divide t...
research
09/09/2021

An objective function for order preserving hierarchical clustering

We present an objective function for similarity based hierarchical clust...
research
12/18/2020

Multiscale semidefinite programming approach to positioning problems with pairwise structure

We consider the optimization of pairwise objective functions, i.e., obje...
research
08/25/2020

Efficient Hierarchical Clustering for Classification and Anomaly Detection

We address the problem of large scale real-time classification of conten...

Please sign up or login with your details

Forgot password? Click here to reset