Strong Consistency of Factorial K-means Clustering
Abstract
Factorial k-means (FKM) clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that the partition of objects and the low-dimensional subspace reflecting the cluster structure are obtained, simultaneously. Conditions that ensure the almost sure convergence of the estimator of FKM clustering as the sample size increases unboundedly are derived. The result is proved for a more general model including FKM clustering.
Keywords
Cite
@article{arxiv.1301.0676,
title = {Strong Consistency of Factorial K-means Clustering},
author = {Yoshikazu Terada},
journal= {arXiv preprint arXiv:1301.0676},
year = {2014}
}
Comments
A revised version of this was accepted in Annals of the Institute of Statistical Mathematics. Please refer to the accepted version of this. In the accepted ver., I describe a new interesting fact that there exists some cases in which reduced k-means clustering becomes equivalent to FKM clustering as n goes to infinity and provide a rough large deviation inequality for FKM clustering