An Information-theoretic Perspective of Hierarchical Clustering

08/13/2021
by   Yicheng Pan, et al.
0

A combinatorial cost function for hierarchical clustering was introduced by Dasgupta <cit.>. It has been generalized by Cohen-Addad et al. <cit.> to a general form named admissible function. In this paper, we investigate hierarchical clustering from the information-theoretic perspective and formulate a new objective function. We also establish the relationship between these two perspectives. In algorithmic aspect, we get rid of the traditional top-down and bottom-up frameworks, and propose a new one to stratify the sparsest level of a cluster tree recursively in guide with our objective function. For practical use, our resulting cluster tree is not binary. Our algorithm called HCSE outputs a k-level cluster tree by a novel and interpretable mechanism to choose k automatically without any hyper-parameter. Our experimental results on synthetic datasets show that HCSE has a great advantage in finding the intrinsic number of hierarchies, and the results on real datasets show that HCSE also achieves competitive costs over the popular algorithms LOUVAIN and HLP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2021

Hierarchical Clustering: New Bounds and Objective

Hierarchical Clustering has been studied and used extensively as a metho...
research
01/02/2018

Co-Clustering via Information-Theoretic Markov Aggregation

We present an information-theoretic cost function for co-clustering, i.e...
research
12/06/2018

An Improved Cost Function for Hierarchical Cluster Trees

Hierarchical clustering has been a popular method in various data analys...
research
06/16/2023

Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs

This paper presents two efficient hierarchical clustering (HC) algorithm...
research
12/29/2021

Shallow decision trees for explainable k-means clustering

A number of recent works have employed decision trees for the constructi...
research
12/15/2020

Objective-Based Hierarchical Clustering of Deep Embedding Vectors

We initiate a comprehensive experimental study of objective-based hierar...
research
05/02/2023

Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering

We present a new multi-layer peeling technique to cluster points in a me...

Please sign up or login with your details

Forgot password? Click here to reset