Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
Most clustering methods need a pre-determined clustering number or a certain similarity threshold, which makes them dependent on heuristic knowledge. The X-means method tries to estimate the number of clusters but only converges locally. This paper presents a novel and simple clustering algorithm named as Auto-K after its descriptive parent-algorithm-K-means, though Auto-K theory can be generalized beyond certain given deriving algorithms. In Auto-K, the algorithm itself automatically selects a globally optimal clustering number for the involved population, by maximizing the clustering fitness and thus the clustering process can be said to be really dynamic and most accordant with human`s common sense in clustering.
How to cite this article:
Xiwu Han and Tiejun Zhao . Auto-K Dynamic Clustering Algorithm.
DOI: https://doi.org/10.36478/ajit.2005.467.471
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2005.467.471