Level Sets or Gradient Lines? A Unifying View of Modal Clustering

09/17/2021
by   Ery Arias-Castro, et al.
0

The paper establishes a strong correspondence, if not an equivalence, between two important clustering approaches that emerged in the 1970's: clustering by level sets or cluster tree as proposed by Hartigan and clustering by gradient lines or gradient flow as proposed by Fukunaga and Hosteler.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2021

An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Tree

Two important nonparametric approaches to clustering emerged in the 1970...
research
03/16/2018

Consistent sets of lines with no colorful incidence

We consider incidences among colored sets of lines in R^d and examine wh...
research
06/11/2020

Tight frames over the quaternions and equiangular lines

We show that much of the theory of finite tight frames can be generalise...
research
06/12/2020

Distance-based phylogenetic inference from typing data: a unifying view

Typing methods are widely used in the surveillance of infectious disease...
research
11/26/2020

Faster Projective Clustering Approximation of Big Data

In projective clustering we are given a set of n points in R^d and wish ...
research
06/08/2016

On clustering network-valued data

Community detection, which focuses on clustering nodes or detecting comm...
research
12/01/2022

Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation

A clustering termination procedure which is locally adaptive (with respe...

Please sign up or login with your details

Forgot password? Click here to reset