Analysis and Improvement for K-Means Algorithm

Jing Zhong Xiao; Li Xiao

doi:10.4028/www.scientific.net/AMM.52-54.1976

Paper Titles

Research on Low Carbon City Development
p.1953

Multidisciplinary Optimization Method about the Thickness of Engine Hood Based on Pedestrian Protection
p.1958

Measurement Slub Yarn Parameter by Parallel-Plate Capacitor
p.1964

Determination on Slub Length for Slubby Yarn of Ring Bobbin
p.1970

Analysis and Improvement for K-Means Algorithm
p.1976

A Graph Clustering Algorithm for the Homology Detection
p.1981

Experimental Investigation on the Polypropylene Fiber Concrete Performance of Yellow River Canal Lining in the Middle Line of South-to-North Water Transfer Project
p.1987

Research about Application of Informatization Service on Tourism Economy Management
p.1992

An Automation Fuzzy Switching Bang-Bang Controller for Industrial Applications
p.1997

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 52-54Analysis and Improvement for K-Means Algorithm

Analysis and Improvement for K-Means Algorithm

Abstract:

K-Means algorithm is one of the mostly used foundation algorithm in data mining, it base on a greedy clustering algorithm. This paper will introduce this algorithm and analysis. Then prove the correctness of the algorithm. And then show the productivity of this algorithm. And at last, this paper will show some improvement to K-Means algorithm, including how to choose initial center points, and how to calculate the means. This will improve the algorithm at a certain extent.

You might also be interested in these eBooks

Advances in Mechanical Engineering (ICME)

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 52-54)

Pages:

1976-1980

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.52-54.1976

Citation:

Cite this paper

Online since:

March 2011

Authors:

Jing Zhong Xiao, Li Xiao

Keywords:

Center Point, Cluster Algorithm, K-Mean

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] P.K. Agarwal and C.M. Procopiuc, ªExact and Approximation Algorithms for Clustering, º Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms, pp.658-667, Jan. (1998).

Google Scholar

[2] K. Alsabti, S. Ranka, and V. Singh, ªAn Efficient k-means Clustering Algorithm, º Proc. First Workshop High Performance DataMining, Mar. (1998).

Google Scholar

[3] S. Arora, P. Raghavan, and S. Rao, ªApproximation Schemes for Euclidean k-median and Related Problems, º Proc. 30th Ann. ACM Symp. Theory of Computing, pp.106-113, May (1998).

Google Scholar

[4] S. Arya and D. M. Mount, ªApproximate Range Searching, Computational Geometry: Theory and Applications, vol. 17, pp.135-163, (2000).

Google Scholar

[5] S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu, An Optimal Algorithm for Approximate Nearest NeighborSearching, ºJ. ACM, vol. 45, pp.891-923, (1998).

DOI: 10.1145/293347.293348

Google Scholar

[6] G.H. Ball and D.J. Hall, ªSome Fundamental Concepts and Synthesis Procedures for Pattern Recognition Preprocessors, Proc. Int'l Conf. Microwaves, Circuit Theory, and Information Theory, Sept. (1964).

Google Scholar

[7] J.L. Bentley, ªMultidimensional Binary Search Trees Used for Associative Searching, º Comm. ACM, vol. 18, pp.509-517, (1975).

DOI: 10.1145/361002.361007

Google Scholar