K-Means is a popular clustering algorithm to find the clustering easily by iteration. But the computational complexity of the traditional K-Means due to accessing the whole data in each cycle of iterative operations is too great to make it fit for very large data set. This paper presents a new clustering algorithm we have developed, Fast K-Means Clustering Algorithm based on Grid Data Reduction (GDR-FKM), by which clustering operations can be quickly performed on very large data set. Application of the algorithm to analysis of the data relativity in TT&C has demonstrated its celerity and accuracy.
A Fast K-Means Clustering Algorithm Based on Grid Data Reduction
2008-03-01
2474769 byte
Conference paper
Electronic Resource
English
K-Harmonic Means Data Clustering with PSO Algorithm
Springer Verlag | 2012
|Modified K-Means Clustering Algorithm
IEEE | 2008
|Improved K-Means Clustering Algorithm
IEEE | 2008
|Artificial Immune C-Means Clustering Algorithm
British Library Online Contents | 2005
|A Robust Fuzzy c-Means Clustering Algorithm for Incomplete Data
Springer Verlag | 2017
|