AI Chat AI Image Generator AI Video Text to Speech

Guarantees for Hierarchical Clustering by the Sublevel Set method

06/18/2020

∙

by Marina Meila, et al.

∙

∙

Meila (2018) introduces an optimization based method called the Sublevel Set method, to guarantee that a clustering is nearly optimal and "approximately correct" without relying on any assumptions about the distribution that generated the data. This paper extends the Sublevel Set method to the cost-based hierarchical clustering paradigm proposed by Dasgupta (2016).

page 1

page 2

page 3

page 4

research

∙ 07/30/2021

Distribution free optimality intervals for clustering

We address the problem of validating the ouput of clustering algorithms....

0 Marina Meila, et al. ∙

research

∙ 06/05/2021

Cluster Analysis via Random Partition Distributions

Hierarchical and k-medoids clustering are deterministic clustering algor...

0 David B. Dahl, et al. ∙

research

∙ 04/26/2020

Order preserving hierarchical agglomerative clustering of strict posets

We present a method for hierarchical clustering of directed acyclic grap...

0 Daniel Bakkelund, et al. ∙

research

∙ 05/24/2018

Hierarchical Clustering with Structural Constraints

Hierarchical clustering is a popular unsupervised data analysis method. ...

0 Vaggos Chatziafratis, et al. ∙

research

∙ 11/02/2018

Foundations of Comparison-Based Hierarchical Clustering

We address the classical problem of hierarchical clustering, but in a fr...

0 Debarghya Ghoshdastidar, et al. ∙

research

∙ 02/21/2019

Sparse Elasticity Reconstruction and Clustering using Local Displacement Fields

This paper introduces an elasticity reconstruction method based on local...

0 Megumi Nakao, et al. ∙

research

∙ 06/19/2016

Clustering with a Reject Option: Interactive Clustering as Bayesian Prior Elicitation

A good clustering can help a data analyst to explore and understand a da...

0 Akash Srivastava, et al. ∙