Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms

Research Collection School Of Computing and Information Systems

K selection problem

Articles 1 - 1 of 1

Full-Text Articles in Computer Engineering

A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas Nov 2022

A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

K-Means clustering algorithm does not offer a clear methodology to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. In this paper, we present a new metric for clustering quality and describe its use for K selection. The proposed metric, based on the locations of the centroids, as well as the desired properties of the clusters, is developed in two stages. In the initial stage, we take into account the full covariance matrix of the clustering variables, thereby making it mathematically similar to a reduced chi2. We then extend it to account for …