Clustering by Hill-Climbing: Consistency Results

2022/02/18 by Ery Arias-Castro, Arias-Castro, Ery, Wanli Qiao +1
Computer Science · #Advanced Clustering Algorithms Research #Classical Analysis and ODEs (math.CA) #Data Management and Algorithms #Data Mining Algorithms and Applications #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (stat.ML) #Statistics Theory (math.ST)

paper · pdf · doi:10.48550/arxiv.2202.09023

openalex publication_date 2022/02/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider several hill-climbing approaches to clustering as formulated by Fukunaga and Hostetler in the 1970's. We study both continuous-space and discrete-space (i.e., medoid) variants and establish their consistency.

Related

• An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Tree
• Moving Up the Cluster Tree with the Gradient Flow
• Asymptotic Theory of Geometric and Adaptive k-Means Clustering
• The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering
• An Algorithmic Introduction to Clustering