A Population Background for Nonparametric Density-Based Clustering
Not on the map. Why?
Abstract (arXiv)
Despite its popularity, it is widely recognized that the investigation of some theoretical aspects of clustering has been relatively sparse. One of the main reasons for this lack of theoretical results is surely the fact that, whereas for other statistical problems the theoretical population goal is clearly defined (as in regression or classification), for some of the clustering methodologies it is difficult to specify the population goal to which the data-based clustering algorithms should try to get close. This paper aims to provide some insight into the theoretical foundations of clustering by focusing on two main objectives: to provide an explicit formulation for the ideal population goal of the modal clustering methodology, which understands clusters as regions of high density; and to present two new loss functions, applicable in fact to any clustering methodology, to evaluate the performance of a data-based clustering algorithm with respect to the ideal population goal. In particular, it is shown that only mild conditions on a sequence of density estimators are needed to ensure that the sequence of modal clusterings that they induce is consistent.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Aug 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 4; 2023: 1; 2024: 1; 2025: 0; 2026: 2.
14 papers.
Sort:
- 2021Moving Up the Cluster Tree with the Gradient Flowcited by 3
- 2022Tight Bounds on the Hardness of Learning Simple Nonparametric Mixturescited by 3
- 2021Space Partitioning and Regression Mode Seeking via a Mean-Shift-Inspired Algorithmcited by 2
- 2021Skeleton Clustering: Dimension-Free Density-based Clusteringcited by 2
- 2022Clustering by Hill-Climbing: Consistency Resultscited by 2
- 2021An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Treecited by 1
- 2026Scalable Posterior Uncertainty for Flexible Density-Based Clusteringcited by 1
- 2021Nonparametric clustering for image segmentationcited by 0
- 2021On Integral Theorems and their Statistical Propertiescited by 0
- 2022Bump hunting through density curvature featurescited by 0
- 2022Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Setscited by 0
- 2023Bayesian taut splines for estimating the number of modescited by 0
- 2026Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shift5 Aug 2026
- 2026Scalable Posterior Uncertainty for Flexible Density-Based Clustering3 Mar 2026
- 2024Graph Max Shift: A Hill-Climbing Method for Graph Clustering27 Nov 2024
- 2023Bayesian taut splines for estimating the number of modes11 Jul 2023
- 2022Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Sets18 Oct 2022
- 2022Bump hunting through density curvature features30 Jul 2022
- 2022Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures28 Mar 2022
- 2022Clustering by Hill-Climbing: Consistency Results18 Feb 2022
- 2021An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Tree19 Nov 2021
- 2021Moving Up the Cluster Tree with the Gradient Flow17 Sep 2021
- 2021On Integral Theorems and their Statistical Properties22 Jul 2021
- 2021Skeleton Clustering: Dimension-Free Density-based Clustering21 Apr 2021
2 more
- 2021Moving Up the Cluster Tree with the Gradient Flowcited by 3
- 2022Tight Bounds on the Hardness of Learning Simple Nonparametric Mixturescited by 3
- 2021Space Partitioning and Regression Mode Seeking via a Mean-Shift-Inspired Algorithmcited by 2
- 2021Skeleton Clustering: Dimension-Free Density-based Clusteringcited by 2
- 2022Clustering by Hill-Climbing: Consistency Resultscited by 2
- 2021An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Treecited by 1
- 2026Scalable Posterior Uncertainty for Flexible Density-Based Clusteringcited by 1
- 2021Nonparametric clustering for image segmentationcited by 0
- 2021On Integral Theorems and their Statistical Propertiescited by 0
- 2022Bump hunting through density curvature featurescited by 0
- 2022Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Setscited by 0
- 2023Bayesian taut splines for estimating the number of modescited by 0
12 most cited of 14 All 14 (JSON)
- 2026Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shift5 Aug 2026
- 2026Scalable Posterior Uncertainty for Flexible Density-Based Clustering3 Mar 2026
- 2024Graph Max Shift: A Hill-Climbing Method for Graph Clustering27 Nov 2024
- 2023Bayesian taut splines for estimating the number of modes11 Jul 2023
- 2022Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Sets18 Oct 2022
- 2022Bump hunting through density curvature features30 Jul 2022
- 2022Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures28 Mar 2022
- 2022Clustering by Hill-Climbing: Consistency Results18 Feb 2022
- 2021An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Tree19 Nov 2021
- 2021Moving Up the Cluster Tree with the Gradient Flow17 Sep 2021
- 2021On Integral Theorems and their Statistical Properties22 Jul 2021
- 2021Skeleton Clustering: Dimension-Free Density-based Clustering21 Apr 2021
12 newest of 14 All 14 (JSON)