Saved in:
Bibliographic Details
Main Authors: Rolle, Alexander, Scoccola, Luis
Format: Preprint
Published: 2020
Subjects:
Online Access:https://arxiv.org/abs/2005.09048
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916803684335616
author Rolle, Alexander
Scoccola, Luis
author_facet Rolle, Alexander
Scoccola, Luis
contents We consider the degree-Rips construction from topological data analysis, which provides a density-sensitive, multiparameter hierarchical clustering algorithm. We analyze its stability to perturbations of the input data using the correspondence-interleaving distance, a metric for hierarchical clusterings that we introduce. Taking certain one-parameter slices of degree-Rips recovers well-known methods for density-based clustering, but we show that these methods are unstable. However, we prove that degree-Rips, as a multiparameter object, is stable, and we propose an alternative approach for taking slices of degree-Rips, which yields a one-parameter hierarchical clustering algorithm with better stability properties. We prove that this algorithm is consistent, using the correspondence-interleaving distance. We provide an algorithm for extracting a single clustering from one-parameter hierarchical clusterings, which is stable with respect to the correspondence-interleaving distance. And, we integrate these methods into a pipeline for density-based clustering, which we call Persistable. Adapting tools from multiparameter persistent homology, we propose visualization tools that guide the selection of all parameters of the pipeline. We demonstrate Persistable on benchmark data sets, showing that it identifies multi-scale cluster structure in data.
format Preprint
id arxiv_https___arxiv_org_abs_2005_09048
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle Stable and consistent density-based clustering via multiparameter persistence
Rolle, Alexander
Scoccola, Luis
Statistics Theory
Machine Learning
62H30 (Primary) 62R40 (Secondary)
We consider the degree-Rips construction from topological data analysis, which provides a density-sensitive, multiparameter hierarchical clustering algorithm. We analyze its stability to perturbations of the input data using the correspondence-interleaving distance, a metric for hierarchical clusterings that we introduce. Taking certain one-parameter slices of degree-Rips recovers well-known methods for density-based clustering, but we show that these methods are unstable. However, we prove that degree-Rips, as a multiparameter object, is stable, and we propose an alternative approach for taking slices of degree-Rips, which yields a one-parameter hierarchical clustering algorithm with better stability properties. We prove that this algorithm is consistent, using the correspondence-interleaving distance. We provide an algorithm for extracting a single clustering from one-parameter hierarchical clusterings, which is stable with respect to the correspondence-interleaving distance. And, we integrate these methods into a pipeline for density-based clustering, which we call Persistable. Adapting tools from multiparameter persistent homology, we propose visualization tools that guide the selection of all parameters of the pipeline. We demonstrate Persistable on benchmark data sets, showing that it identifies multi-scale cluster structure in data.
title Stable and consistent density-based clustering via multiparameter persistence
topic Statistics Theory
Machine Learning
62H30 (Primary) 62R40 (Secondary)
url https://arxiv.org/abs/2005.09048