Initial Cluster Centers Based on Moving Two Lines Approximation in K-means Algorithm

Authors

  • Wenyue Feng
  • Shuangxia Xuan

DOI:

https://doi.org/10.54097/fcis.v2i1.2488

Keywords:

Initial cluster centers, Moving two lines approximation, K-means algorithm

Abstract

The main shortcoming of K-means clustering algorithm is its great dependence on the initial cluster center point. Based on the moving two lines approximation model, this paper gives a method to pick the initial cluster center of k-means clustering. Numerical experiments and comparison criteria show that this method can get better clustering effect.

Downloads

Download data is not yet available.

References

Fayyad U, Reina C, Bradley PS: Initialization of iterative refinement clustering algorithm. In:Proc of the Fourth International Conference on Knowledge Discovery and Data Mining. AAAI,Menlo Park. 1998:194-198.

L. X. Bang, J. H. Yang, M.G. Wang: Using genetic algorithm to improve K-means clustering algorithm in clustering analysis[J]. Mathematical Statistics and Applied Probability, 1997, 1 2(4):350—356. (In Chinese)

Krishma K, Murty MN: Genetic k-means algorithm[J]. IEEE Transactions on System, Man and Cybemetics, Part B. 1999. 29(3): 433-439.

Likas, A., Vlassis, N., Jakob, J.V.: The global k-means algorithm algorithm. Pattern Recognition 2003, 36, 451–461.

Khan, S.S., Ahmad, A.: Cluster center initialization algorithm for k-means clustering. Pattern Recognition Lett. 2004, 25, 1293–1302.

Deelers, S., Auwatanamongkol, S.: Enhancing k-means algorithm with initial cluster centers derived from data partitioning along the data axis with the highest variance. Internat. J. Comput. Sci. 2007, 2, 247–252.

Murat Erisoglu, Nazif Calis, SadullahSakallioglu: A new algorithm for initial cluster centers in k-means algorithm. Pattern Recognition Lett. 32, 1701–1705.

Yang Z, Kim T: Moving parabolic approximation of point clouds[J]. Computer-Aided Design, 2007, 39(12): 1091-1112.

W. Y. Feng, Z. W.Yang, J. S. Deng: Moving multiple curves/surfaces approximation of mixed point clouds[J]. Communications in Mathematics and Statistics, 2014, 2(1): 107-124.

Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Amer. Statist. Assoc. 1971, 66, 846–850

Downloads

Published

23-11-2022

Issue

Section

Articles

How to Cite

Feng, W., & Xuan, S. (2022). Initial Cluster Centers Based on Moving Two Lines Approximation in K-means Algorithm. Frontiers in Computing and Intelligent Systems, 2(1), 23-25. https://doi.org/10.54097/fcis.v2i1.2488