Strong Consistency for a Class of Adaptive Clustering Procedures

02/27/2022
by   Adam Quinn Jaffe, et al.
0

We introduce a class of clustering procedures which includes k-means and k-medians, as well as variants of these where the domain of the cluster centers can be chosen adaptively (for example, k-medoids) and where the number of cluster centers can be chosen adaptively (for example, according to the elbow method). In the non-parametric setting and assuming only the finiteness of certain moments, we show that all clustering procedures in this class are strongly consistent under IID samples. Our method of proof is to directly study the continuity of various deterministic maps associated with these clustering procedures, and to show that strong consistency simply descends from analogous strong consistency of the empirical measures. In the adaptive setting, our work provides a strong consistency result that is the first of its kind. In the non-adaptive setting, our work strengthens Pollard's classical result by dispensing with various unnecessary technical hypotheses, by upgrading the particular notion of strong consistency, and by using the same methods to prove further limit theorems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2022

Clustering by Hill-Climbing: Consistency Results

We consider several hill-climbing approaches to clustering as formulated...
research
06/19/2019

Robust Clustering Using Tau-Scales

K means is a popular non-parametric clustering procedure introduced by S...
research
06/13/2013

Non-parametric Power-law Data Clustering

It has always been a great challenge for clustering algorithms to automa...
research
12/22/2022

Fréchet Mean Set Estimation in the Hausdorff Metric, via Relaxation

This work resolves the following question in non-Euclidean statistics: I...
research
09/21/2023

Model-based Clustering using Non-parametric Hidden Markov Models

Thanks to their dependency structure, non-parametric Hidden Markov Model...
research
08/09/2019

Unexpected Effects of Online K-means Clustering

In this paper we study k-means clustering in the online setting. In the ...
research
07/16/2018

Group Invariance and Computational Sufficiency

Statistical sufficiency formalizes the notion of data reduction. In the ...

Please sign up or login with your details

Forgot password? Click here to reset