A parallel k-means clustering initial center selection and dynamic center correction on GPU

被引:0
|
作者
Kakooei, Mohammad [1 ]
Shahhoseini, Hadi Shahriar [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Elect Engn, Tehran, Iran
来源
2014 22nd Iranian Conference on Electrical Engineering (ICEE) | 2014年
关键词
GPGPU; Initial center; Parallel clustering; Dynamic center correction; CUDA;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
K-means clustering algorithm is a partition based clustering algorithm which has been widely used in data mining applications. This algorithm suffers from an issue, named initial centers selection. This problem significantly effects on the quality and running time of clustering. Several literatures discussed on this problem and try to select the best initial centers to prevent final results from getting into local minimum and inaccurate results. Although initial center selection decreases the total running time, it imposes a time overhead that can be solved by parallel design. In addition, previous solutions didn't consider the algorithm behavior after selecting the initial centers, which is considered by dynamic correction in this work. Graphic Processing Unites has several parallel cores which provide a parallel device for developers. This paper proposes a parallel initial centers selection and dynamic center correction on GPU which is fast, accurate and scalable.
引用
收藏
页码:20 / 25
页数:6
相关论文
共 50 条
  • [41] An Improved Initialization Center K-means Clustering Algorithm Based on Distance and Density
    Duan, Yanling
    Liu, Qun
    Xia, Shuyin
    ADVANCES IN MATERIALS, MACHINERY, ELECTRONICS II, 2018, 1955
  • [42] Stability and model selection in k-means clustering
    Ohad Shamir
    Naftali Tishby
    Machine Learning, 2010, 80 : 213 - 243
  • [43] Deterministic Feature Selection for k-Means Clustering
    Boutsidis, Christos
    Magdon-Ismail, Malik
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (09) : 6099 - 6110
  • [44] A Variable Selection Procedure for K-Means Clustering
    Kim, Sung-Soo
    KOREAN JOURNAL OF APPLIED STATISTICS, 2012, 25 (03) : 471 - 483
  • [45] Stability and model selection in k-means clustering
    Shamir, Ohad
    Tishby, Naftali
    MACHINE LEARNING, 2010, 80 (2-3) : 213 - 243
  • [46] On Parallel k-Center Clustering
    Coy, Sam
    Czumaj, Artur
    Mishra, Gopinath
    PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 65 - 75
  • [47] Initial Seed Selection for Mixed Data Using Modified K-means Clustering Algorithm
    S. A. Sajidha
    Kalyani Desikan
    Siddha Prabhu Chodnekar
    Arabian Journal for Science and Engineering, 2020, 45 : 2685 - 2703
  • [48] Initial Seed Selection for Mixed Data Using Modified K-means Clustering Algorithm
    Sajidha, S. A.
    Desikan, Kalyani
    Chodnekar, Siddha Prabhu
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2020, 45 (04) : 2685 - 2703
  • [49] Research on selecting initial points for k-means clustering
    Wang, Shou-Qiang
    Zhu, Da-Ming
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 2673 - 2677
  • [50] SELECTION OF INITIAL PARAMETERS OF K-MEANS CLUSTERING ALGORITHM FOR MRI BRAIN IMAGE SEGMENTATION
    Liu, Jian-Wei
    Guo, Lei
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL. 1, 2015, : 123 - 127