Volume 13 Number 6 (Jun. 2018)
Home > Archive > 2018 > Volume 13 Number 6 (Jun. 2018) >
JCP 2018 Vol.13(6): 588-595 ISSN: 1796-203X
doi: 10.17706/jcp.13.6.588-595

Bisecting K-means Algorithm Based on K-valued Selfdetermining and Clustering Center Optimization

Jian Di, Xinyue Gou
School of Control and Computer Engineering, North China Electric Power University, Baoding, Hebei, China.
Abstract—The initial clustering centers of traditional bisecting K-means algorithm are randomly selected and the k value of traditional bisecting K-means algorithm could not determine beforehand. This paper proposes a improve bisecting K-means algorithm based on automatically determining K value and the optimization of the cluster center. Firstly, the initial cluster centers are selected by using the point density and the distance function; Secondly, automatically determining K value is proposed by using Intra cluster similarity and inter cluster difference. the experiment results on UCI database show that the algorithm can effectively avoid the influence of noise points and outliers, and improve the accuracy and stability of clustering results.

Index Terms—Bisecting k-means, K, cluster center, accuracy rate.

[PDF]

Cite: Jian Di, Xinyue Gou, "Bisecting K-means Algorithm Based on K-valued Selfdetermining and Clustering Center Optimization," Journal of Computers vol. 13, no. 6, pp. 588-595, 2018.

General Information

ISSN: 1796-203X
Frequency: Monthly (2006-2014); Bimonthly (Since 2015)
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, DOAJ, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Sep 26, 2017 News!

    Papers published in JCP Volume 12 have all been indexed by DBLP   [Click]

  • Sep 02, 2016 News!

    Vol 11, No 3 has been indexed by EI (Inspec)   [Click]

  • Sep 22, 2017 News!

    Vol 13, No 6 has been published with online version 11 papers are published in this issue after peer review   [Click]

  • Aug 14, 2017 News!

    Vol 13, No 5 has been published with online version   [Click]

  • Jun 21, 2017 News!

    Vol 13, No 4 has been published with online version   [Click]

  • Read more>>