Automatic Optimization Algorithm of Clusters Number Based on Maximum Distance

Article Preview

Abstract:

K-means clustering algorithm clusters datasets according to the certain clustering number k.However k cannot be confirmed beforehand.A new clustering validity index was designed from the standpoint of sample geometry.Based on the index a new method for determining the optimal clustering number in K-means clustering algorithm was proposed.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

231-234

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] MacQueen J. Some methods for classification and analysis of multivariate observations[C]. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. Berkeley: University of California Press, 1967: 281-297.

Google Scholar

[2] Jain A K, Dubes R C. Algorithms for Clustering Data. Englewood Cliffs, NJ, USA: Prentice-Hall, (1988).

Google Scholar

[3] Xu R, Wunsch D. Survey of clustering algorithm. IEEE Trans. Neural Networks, 2005, 16(3): 645-678.

Google Scholar

[4] Milligan G W, Cooper M C. An examination of procedures for determining the number of clusters in a data set. Psy-chometrika, 1985, 50: 159-179.

DOI: 10.1007/bf02294245

Google Scholar

[5] UCI Repository of machine learning databases and domain theories[EB/OL]. FTP address: ftp: /ftp. ics. uc. i edu/pub /machine-learning-databases.

Google Scholar

[6] Xie X L, Beni G. A validity measure for fuzzy clustering. IEEE Trans. Pattern Anal. Machin. Intell., 1991, 13(8): 841-847.

DOI: 10.1109/34.85677

Google Scholar