Hierarchical Maximum-Margin Clustering

02/06/2015
by   Guang-Tong Zhou, et al.
0

We present a hierarchical maximum-margin clustering method for unsupervised data analysis. Our method extends beyond flat maximum-margin clustering, and performs clustering recursively in a top-down manner. We propose an effective greedy splitting criteria for selecting which cluster to split next, and employ regularizers that enforce feature sharing/competition for capturing data semantics. Experimental results obtained on four standard datasets show that our method outperforms flat and hierarchical clustering baselines, while forming clean and semantically meaningful cluster hierarchies.

READ FULL TEXT
research
05/18/2020

Stable and consistent density-based clustering

We present a consistent approach to density-based clustering, which sati...
research
10/22/2020

Scalable Bottom-Up Hierarchical Clustering

Bottom-up algorithms such as the classic hierarchical agglomerative clus...
research
11/03/2022

Convex Clustering through MM: An Efficient Algorithm to Perform Hierarchical Clustering

Convex clustering is a modern method with both hierarchical and k-means ...
research
03/03/2023

Contrastive Hierarchical Clustering

Deep clustering has been dominated by flat models, which split a dataset...
research
12/16/2018

Connecting Spectral Clustering to Maximum Margins and Level Sets

We study the connections between spectral clustering and the problems of...
research
11/27/2011

Ward's Hierarchical Clustering Method: Clustering Criterion and Agglomerative Algorithm

The Ward error sum of squares hierarchical clustering method has been ve...
research
04/24/2023

Unsupervised Machine Learning to Classify the Confinement of Waves in Periodic Superstructures

We employ unsupervised machine learning to enhance the accuracy of our r...

Please sign up or login with your details

Forgot password? Click here to reset