The Community for Technology Leaders
2009 Sixth International Conference on Computer Graphics, Imaging and Visualization (2009)
Tianjin, China
Aug. 11, 2009 to Aug. 14, 2009
ISBN: 978-0-7695-3789-4
pp: 410-413
ABSTRACT
The traditional clustering algorithms are designed for large dataset or vary large dataset. It is not easy to cluster the small dataset because of the loss of the statistical character and probability character. In this paper, the class ration is introduced, based on the class ratio, the dynamic clustering algorithm is proposed. The dataset are divided into all possible classes, and the class ratios are computed, the min class ratio is chosen and the clustering about the min class ratio is the best clustering. With the experiments, the schema is an effective way for the clustering of small data sets.
INDEX TERMS
CITATION

M. Hu, T. Peng and M. Jiang, "A Dynamic Clustering Algorithm Based on Small Data Set," 2009 Sixth International Conference on Computer Graphics, Imaging and Visualization(CGIV), Tianjin, China, 2009, pp. 410-413.
doi:10.1109/CGIV.2009.78
84 ms
(Ver 3.3 (11022016))