Estimating the Mean Number of K-Means Clusters to Form

2015/03/07 by Robert A. Murphy, Murphy, Robert A. · 1 citation
Computer Science · #60D05 #FOS: Computer and information sciences #Machine Learning (cs.LG) #cs.LG #msc:60D05

paper · pdf · doi:10.48550/arxiv.1503.03488

These writings are part of a longer writing which has been submitted for publication. I plan to replace this writing (and the other 2 writings) with the single writing that has been submitted for publication. The other writings to be withdraw are 1501.07227 and 1412.4178

arxiv created 2016/02/10 · arxiv updated 2016/02/12

Abstract

Utilizing the sample size of a dataset, the random cluster model is employed in order to derive an estimate of the mean number of K-Means clusters to form during classification of a dataset.

Cited by

• A Critical Connectivity Radius for Segmenting Randomly-Generated, High Dimensional Data Points

Related

• K‐means clustering: A half‐century synthesis
• Identifying the number of clusters for K-Means: A hypersphere density based approach
• Advances in Bayesian random partition models: A comprehensive review
• On The Sharp Threshold Interval Length of Partially Connected Random Geometric Graphs During K-Means Classification
• Degrees of Freedom and Model Selection for k-means Clustering