Adaptive Manifold Clustering

12/10/2019
by   Franz Besold, et al.
0

We extend the theoretical study of a recently proposed nonparametric clustering algorithm called Adaptive Weights Clustering (AWC). In particular, we are interested in the case of high-dimensional data lying in the vicinity of a lower-dimensional non-linear submanifold with positive reach. After a slight adjustment and under rather general assumptions for the cluster structure, the algorithm turns out to be nearly optimal in detecting local inhomogeneities, while aggregating homogeneous data with a high probability. We also adress the problem of parameter tuning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2017

Adaptive Nonparametric Clustering

This paper presents a new approach to non-parametric cluster analysis ca...
research
02/16/2022

Using the left Gram matrix to cluster high dimensional data

For high dimensional data, where P features for N objects (P >> N) are r...
research
12/24/2019

An Entropy-based Variable Feature Weighted Fuzzy k-Means Algorithm for High Dimensional Data

This paper presents a new fuzzy k-means algorithm for the clustering of ...
research
01/30/2018

Links: A High-Dimensional Online Clustering Method

We present a novel algorithm, called Links, designed to perform online c...
research
11/27/2018

Adaptive Wavelet Clustering for Highly Noisy Data

In this paper we make progress on the unsupervised task of mining arbitr...
research
07/24/2013

Cluster Trees on Manifolds

In this paper we investigate the problem of estimating the cluster tree ...
research
11/27/2018

Adaptive Wavelet Clustering for High Noise Data

In this paper we make progress on the unsupervised task of mining arbitr...

Please sign up or login with your details

Forgot password? Click here to reset