mlsanityData to 7 Oct 2026

Clustering by Hill-Climbing: Consistency Results

arXiv 2202.09023 ↗First posted 18 Feb 2022math.ST math.CA stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 10 of its 47 references that are in the map. First posted on arXiv 18 Feb 2022.

Builds on

10 of 47 references.

References · 10

  1. 2017Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolutioncited by 63
  2. 2014A Population Background for Nonparametric Density-Based Clusteringcited by 14
  3. 2018Quickshift++: Provably Good Initializations for Sample-Based Mean Shiftcited by 14
  4. 2015Density Level Sets: Asymptotics, Inference, and Visualizationcited by 11
  5. 2021MeanShift++: Extremely Fast Mode-Seeking With Applications to Segmentation and Object Trackingcited by 9
  6. 2017On the Consistency of Quick Shiftcited by 7
  7. 2013Nonparametric Inference For Density Modescited by 5
  8. 2015Statistical Inference using the Morse-Smale Complexcited by 4
  9. 2021Space Partitioning and Regression Mode Seeking via a Mean-Shift-Inspired Algorithmcited by 2
  10. 2021An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Treecited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.