Adaptive Clustering Using Kernel Density Estimators

08/17/2017
by   Ingo Steinwart, et al.
0

We investigate statistical properties of a clustering algorithm that receives level set estimates from a kernel density estimator and then estimates the first split in the density level cluster tree if such a split is present or detects the absence of such a split. Key aspects of our analysis include finite sample guarantees, consistency, rates of convergence, and an adaptive data-driven strategy for chosing the kernel bandwidth. For the rates and the adaptivity we do not need continuity assumptions on the density such as Hölder continuity, but only require intuitive geometric assumptions of non-parametric nature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2010

Stability of Density-Based Clustering

High density clusters can be characterized by the connected components o...
research
10/18/2021

Recovery Guarantees for Kernel-based Clustering under Non-parametric Mixture Models

Despite the ubiquity of kernel-based clustering, surprisingly few statis...
research
09/30/2014

Fully adaptive density-based clustering

The clusters of a distribution are often defined by the connected compon...
research
05/24/2017

Consistent Kernel Density Estimation with Non-Vanishing Bandwidth

Consistency of the kernel density estimator requires that the kernel ban...
research
07/24/2013

Cluster Trees on Manifolds

In this paper we investigate the problem of estimating the cluster tree ...
research
05/20/2022

Kernel Estimates as General Concept for the Measuring of Pedestrian Density

The standard density definition produces scattered values. Hence approac...
research
07/30/2013

DeBaCl: A Python Package for Interactive DEnsity-BAsed CLustering

The level set tree approach of Hartigan (1975) provides a probabilistica...

Please sign up or login with your details

Forgot password? Click here to reset