Stable and Consistent Density-Based Clustering via Multiparameter Persistence

被引:0
|
作者
Rolle, Alexander [1 ]
Scoccola, Luis [2 ]
机构
[1] Tech Univ Munich, Dept Math, Boltzmannstr 3, D-85748 Garching, Germany
[2] Univ Oxford, Math Inst, Woodstock Rd, Oxford OX2 6GG, England
基金
英国工程与自然科学研究理事会; 美国国家科学基金会; 奥地利科学基金会;
关键词
density-based clustering; topological data analysis; hierarchical clustering; multiparameter persistent homology; interleaving distance; vineyard; SINGLE LINKAGE; STABILITY;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:74
相关论文
共 50 条
  • [21] FULLY ADAPTIVE DENSITY-BASED CLUSTERING
    Steinwart, Ingo
    ANNALS OF STATISTICS, 2015, 43 (05): : 2132 - 2167
  • [22] Anytime parallel density-based clustering
    Mai, Son T.
    Assent, Ira
    Jacobsen, Jon
    Dieu, Martin Storgaard
    DATA MINING AND KNOWLEDGE DISCOVERY, 2018, 32 (04) : 1121 - 1176
  • [23] Fast density-based clustering algorithm
    Zhou, Shuigeng
    Zhou, Aoying
    Cao, Jing
    Hu, Yunfa
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2000, 37 (11): : 1287 - 1292
  • [24] The Framework of Relative Density-Based Clustering
    Cui, Zelin
    Shen, Hong
    PARALLEL ARCHITECTURE, ALGORITHM AND PROGRAMMING, PAAP 2017, 2017, 729 : 343 - 352
  • [25] Density-based clustering with differential privacy
    Wu, Fuyu
    Du, Mingjing
    Zhi, Qiang
    INFORMATION SCIENCES, 2024, 681
  • [26] A varied density-based clustering algorithm
    Fahim, Ahmed
    JOURNAL OF COMPUTATIONAL SCIENCE, 2023, 66
  • [27] Feature Selection for Density-Based Clustering
    Ling, Yun
    Ye, Chongyi
    2009 INTERNATIONAL SYMPOSIUM ON INTELLIGENT UBIQUITOUS COMPUTING AND EDUCATION, 2009, : 226 - 229
  • [28] An ensemble density-based clustering method
    Xia, Luning
    Jing, Jiwu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (ISKE 2007), 2007,
  • [29] Hierarchical density-based clustering of shapes
    Gautama, T
    Van Hulle, MM
    NEURAL NETWORKS FOR SIGNAL PROCESSING XI, 2001, : 213 - 222
  • [30] Deep density-based image clustering
    Ren, Yazhou
    Wang, Ni
    Li, Mingxia
    Xu, Zenglin
    KNOWLEDGE-BASED SYSTEMS, 2020, 197