Improved K-Means Clustering Algorithm Based on KD-Tree Approach

被引：1
|
作者：
Bhardwaj, Manish [1 ]
Adane, Dattatraya [2 ]
机构：
[1] Shri Ramdeobaba Coll Engn & Management, Comp Sci & Engn Dept, Nagpur, Maharashtra, India
[2] Shri Ramdeobaba Coll Engn & Management, Dept Informat Technol, Nagpur, Maharashtra, India
来源：
BIOSCIENCE BIOTECHNOLOGY RESEARCH COMMUNICATIONS | 2020年 / 13卷 / 14期
关键词：
K-MEANS; CLUSTERING ANALYSIS; OPENMP; PARALLEL APPROACH;
D O I：
10.21786/bbrc/13.14/38
中图分类号：
Q81 [生物工程学（生物技术）]; Q93 [微生物学];
学科分类号：
071005 ; 0836 ; 090102 ; 100705 ;
摘要：
The Cluster Analysis is a vast area of application such as security, Image recognition, scientific investigation, business intelligence, biology, and web search. K-Means clustering algorithm is not performing well with huge data sets in terms of Execution time. To overcome this, A Parallel Approach is used to implement the K-Means algorithm using OpenMP API with the KD-Tree approach to provide dynamic load balancing, optimized execution time, and maintaining accuracy. The experiments are performed on handwritten digits and Bagofword data sets by using a system with multi-core. After the analysis of the Sequential approach and Parallel approach of implementation of K-Means, it is observed that the parallel approach outperforms with similar accuracy utilizing the computing resources available with the multi-core systems.
引用
收藏
页码：160 / 163
页数：4
相关论文
共 50 条
  • [1] An FPGA implementation of k-means clustering for color images based on kd-tree
    Saegusa, Takashi
    Maruyama, Tsutomu
    2006 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, 2006, : 567 - 572
  • [2] Research on k-means Clustering Algorithm An Improved k-means Clustering Algorithm
    Shi Na
    Liu Xumin
    Guan Yong
    2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 63 - 67
  • [3] An Improved K-means Clustering Algorithm
    Wang Yintong
    Li Wanlong
    Gao Rujia
    2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [4] Density Clustering Algorithm Based on KD-Tree and Voting Rules
    Du, Hui
    Hu, Zhiyuan
    Lu, Depeng
    Liu, Jingrui
    CMC-COMPUTERS MATERIALS & CONTINUA, 2024, 79 (02): : 3239 - 3259
  • [5] Improved K-means clustering algorithm
    Zhang, Zhe
    Zhang, Junxi
    Xue, Huifeng
    CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 5, PROCEEDINGS, 2008, : 169 - 172
  • [6] An improved K-means clustering algorithm
    Huang, Xiuchang
    Su, Wei
    Journal of Networks, 2014, 9 (01) : 161 - 167
  • [7] Improved Algorithm for the k-means Clustering
    Zhang, Sheng
    Wang, Shouqiang
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 4717 - 4720
  • [8] A Clustering K-means Algorithm Based on Improved PSO Algorithm
    Tan, Long
    2015 FIFTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT2015), 2015, : 940 - 944
  • [9] K-Means Algorithm Performance Analysis With Determining The Value Of Starting Centroid With Random And KD-Tree Method
    Sirait, Kamson
    Tulus
    Nababan, Erna Budhiarti
    INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY (ICONICT), 2017, 930
  • [10] An Improved K-means Clustering Algorithm Based on Dissimilarity
    Wang Shunye
    PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 2629 - 2633
12345