Journal of Computer and Communications

Volume 2, Issue 11 (September 2014)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.12  Citations  

Parallel K-Means Algorithm for Shared Memory Multiprocessors

HTML  Download Download as PDF (Size: 851KB)  PP. 15-23  
DOI: 10.4236/jcc.2014.211002    2,956 Downloads   4,334 Views  Citations
Author(s)

ABSTRACT

Clustering is the task of assigning a set of instances into groups in such a way that is dissimilarity of instances within each group is minimized. Clustering is widely used in several areas such as data mining, pattern recognition, machine learning, image processing, computer vision and etc. K-means is a popular clustering algorithm which partitions instances into a fixed number clusters in an iterative fashion. Although k-means is considered to be a poor clustering algorithm in terms of result quality, due to its simplicity, speed on practical applications, and iterative nature it is selected as one of the top 10 algorithms in data mining [1]. Parallelization of k-means is also studied during the last 2 decades. Most of these work concentrate on shared-nothing architectures. With the advent of current technological advances on GPU technology, implementation of the k-means algorithm on shared memory architectures recently start to attract some attention. However, to the best of our knowledge, no in-depth analysis on the performance of k-means on shared memory multiprocessors is done in the literature. In this work, our aim is to fill this gap by providing theoretical analysis on the performance of k-means algorithm and presenting extensive tests on a shared memory architecture.

Share and Cite:

Kucukyilmaz, T. (2014) Parallel K-Means Algorithm for Shared Memory Multiprocessors. Journal of Computer and Communications, 2, 15-23. doi: 10.4236/jcc.2014.211002.

Cited by

[1] Federated Momentum Contrastive Clustering
arXiv preprint arXiv:2206.05093, 2022
[2] Federated matrix factorization: Algorithm design and application to data clustering
IEEE Transactions on Signal Processing, 2022
[3] Implementing Parallel Computing to Enhance the Performance of K-mean Algorithm
… Conference on Data …, 2021
[4] A Surrogate Water Quality Index to assess groundwater using a unified DEA-OWA framework
2021
[5] New Partition-based and Density-based approaches for improving clustering
2021
[6] Automatic Identification of Abnormal Tongue Image Using Cnn with K-Mean and Hybrid Firefly Algorithm
2021
[7] En vue de l'obtention du
2021
[8] Assessment of pre-treatment and classification methods for Java paddy field cropping pattern detection on MODIS images
2020
[9] Federated Clustering via Matrix Factorization Models: From Model Averaging to Gradient Sharing
2020
[10] A Survey and systematic categorization of parallel K-means and Fuzzy-c-Means algorithms
2019
[11] A Novel K-Means Clustering-Based FPGA Parallel Processing in Big Data Analysis
Applied Mathematics & Information …, 2019
[12] Parallel 𝑘-means Clustering Algorithm on SMP
International Journal of New Computer Architectures and their Applications, 2018
[13] Optimization of Parallel K-means for Java Paddy Mapping Using Time-series Satelite Imagery
2018
[14] Optimization of Parallel K-means for Java Paddy Mapping Using Time-series Satellite Imagery.
Telkomnika, 2018
[15] Towards real-time 3D continuous occupancy mapping using Hilbert maps
The International Journal of Robotics Research, 2018
[16] Parallel k-means Clustering Algorithm on SMP
2018
[17] Optimization of Parallel K-means for Java Paddy Mapping Using Time-series Satellite Imagery
2018
[18] Risk assessment of water pollution sources based on an integrated k-means clustering and set pair analysis method in the region of Shiyan, China
Science of The Total Environment, 2016
[19] Parallel K-Means Clustering with Triangle Inequality
Semantic Scholar, 2016
[20] Parallel Framework for Efficient k-means Clustering
Proceedings of the 8th Annual ACM India Conference, 2015
[21] FPGA implementation of a Multi-processor for Cluster Analysis
2015

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.