Persistence-Based Clustering in Riemannian Manifolds - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Persistence-Based Clustering in Riemannian Manifolds

(1) , (2) , (1) , (1)
1
2
Frédéric Chazal
Steve Oudot
  • Function : Author

Abstract

We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-based hill-climbing scheme, the novelty of our approach resides in its use of topological persistence to guide the merging of clusters. Our algorithm provides additional feedback in the form of a set of points in the plane, called a persistence diagram (PD), which provably reflects the prominences of the modes of the density. In practice, this feedback enables the user to choose relevant parameter values, so that under mild sampling conditions the algorithm will output the correct number of clusters, a notion that can bemade formally sound within persistence theory. The algorithm only requires rough estimates of the density at the data points, and knowledge of (approximate) pairwise distances between them. It is therefore applicable in any metric space. Meanwhile, its complexity remains practical:although the size of the input distance matrix may be up to quadratic in the number of data points, a careful implementation only uses a linear amount of memory and takes barely more time to run than to read through the input. In this conference version of the paper we emphasize theexperimental aspects of our work, describing the approach, giving an intuitive overview of its theoretical guarantees, discussing the choice of its parameters in practice, and demonstrating its potential in terms of applications through a series of experimental results obtained on synthetic and real-life data sets.

Dates and versions

hal-01094872 , version 1 (14-12-2014)

Identifiers

Cite

Frédéric Chazal, Leonidas J. Guibas, Steve Oudot, Primoz Skraba. Persistence-Based Clustering in Riemannian Manifolds. ACM Annual Symposium on Computational Geometry, Jun 2011, Paris, France. pp.97-106, ⟨10.1145/1998196.1998212⟩. ⟨hal-01094872⟩

Collections

INRIA INRIA2 ANR
165 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More