An Optimized k-means Algorithm for Selecting Initial Clustering Centers

被引：0
|
作者：
Song, Jianhui [1 ]
Li, Xuefei [1 ]
Liu, Yanju [1 ]
机构：
[1] Shenyang Ligong Univ, Sch Automat & Elect Engn, Shenyang 110159, Liaoning, Peoples R China
来源：
INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS | 2015年 / 9卷 / 10期
关键词：
k-means; clustering center; density parameter; maximum distance;
D O I：
10.14257/ijsia.2015.9.10.16
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Selecting the initial clustering centers randomly will cause an instability final result, and make it easy to fall into local minimum. To improve the shortcoming of the existing k-means clustering center selection algorithm, an optimized k-means algorithm for selecting initial clustering centers is proposed in this paper. When the number of the sample's maximum density parameter value is not unique, the distance between the plurality samples with maximum density parameter values is calculated and compared with the average distance of the whole sample sets. The k optimized initial clustering centers are selected by combing the algorithm proposed in this paper with maximum distance means. The algorithm proposed in this paper is tested through the UCI dataset. The experimental results show the superiority of the proposed algorithm.
引用
收藏
页码：177 / 186
页数：10
相关论文
共 50 条
  • [21] An Optimized Algorithm For Efficient Problem Solving In K-MEANS Clustering
    Qureshi, Salim Raza
    Mehta, Sunali
    Gupta, Chaahat
    2017 INTERNATIONAL CONFERENCE ON NEXT GENERATION COMPUTING AND INFORMATION SYSTEMS (ICNGCIS), 2017, : 86 - 91
  • [22] A genetic algorithm that exchanges neighboring centers for k-means clustering
    Laszlo, Michael
    Mukherjee, Sumitra
    PATTERN RECOGNITION LETTERS, 2007, 28 (16) : 2359 - 2366
  • [23] An efficient k-means clustering filtering algorithm using density based initial cluster centers
    Kumar, K. Mahesh
    Reddy, A. Rama Mohan
    INFORMATION SCIENCES, 2017, 418 : 286 - 301
  • [24] A K-means Clustering Algorithm with Meliorated Initial Centers and Its Application to Partition of Diet Structures
    Xie, Jianwen
    Zhang, Yuanbiao
    Jiang, Weigang
    2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION WORKSHOP: IITA 2008 WORKSHOPS, PROCEEDINGS, 2008, : 98 - 102
  • [25] The sorting of frequency hopping signals based on k-means algorithm with optimal initial clustering centers
    Chen, Li-Hu
    Zhang, Er-Yang
    Shen, Rong-Jun
    Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology, 2009, 31 (02): : 70 - 75
  • [26] ANR: An algorithm to recommend initial cluster centers for k-means algorithm
    Delavar, Arash Ghorbannia
    Mohebpour, Gholam Hasan
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2014, 11 (04): : 277 - 290
  • [27] Optimized K-Means Algorithm
    Belhaouari, Samir Brahim
    Ahmed, Shahnawaz
    Mansour, Samer
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
  • [28] Improved Κ-means clustering algorithm for selecting initial clustering centers based on dissimilarity measure
    Liao J.-Y.
    Wu S.
    Liu A.-L.
    Kongzhi yu Juece/Control and Decision, 2021, 36 (12): : 3083 - 3090
  • [29] A K-means Clustering with Optimized Initial Center Based on Hadoop Platform
    Lin, Kunhui
    Li, Xiang
    Zhang, Zhongnan
    Chen, Jiahong
    2014 PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION (ICCSE 2014), 2014, : 263 - 266
  • [30] Improved initial clustering center selection algorithm for K-means
    Chen Lasheng
    Li Yuqiang
    2017 SIGNAL PROCESSING: ALGORITHMS, ARCHITECTURES, ARRANGEMENTS, AND APPLICATIONS (SPA 2017), 2017, : 275 - 279
12345