Next Article in Journal
Accelerated Iterative Learning Control of Speed Ripple Suppression for a Seeker Servo Motor
Previous Article in Journal
SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems
Article Menu

Article Versions

Export Article

Open AccessArticle
Algorithms 2018, 11(10), 151; https://doi.org/10.3390/a11100151

K-Means Cloning: Adaptive Spherical K-Means Clustering

1
Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia
2
Department of Computer Science, Faculty of Comp. & Info, Assiut University, Assiut 71526, Egypt
3
Department of Mathematics, Faculty of Science, Al-Azhar University, Assiut Branch, Assiut 71524, Egypt
4
Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia
5
Electrical Engineering Department, Assiut University, Assiut 71516, Egypt
6
Department of Computer Science, Faculty of Comp. & Info, Assiut University, Assiut 71526, Egypt
*
Author to whom correspondence should be addressed.
Received: 17 May 2018 / Revised: 22 September 2018 / Accepted: 25 September 2018 / Published: 6 October 2018
PDF [922 KB, uploaded 6 October 2018]

Abstract

We propose a novel method for adaptive K-means clustering. The proposed method overcomes the problems of the traditional K-means algorithm. Specifically, the proposed method does not require prior knowledge of the number of clusters. Additionally, the initial identification of the cluster elements has no negative impact on the final generated clusters. Inspired by cell cloning in microorganism cultures, each added data sample causes the existing cluster `colonies’ to evaluate, with the other clusters, various merging or splitting actions in order for reaching the optimum cluster set. The proposed algorithm is adequate for clustering data in isolated or overlapped compact spherical clusters. Experimental results support the effectiveness of this clustering algorithm.
Keywords: data mining; clustering analysis; adaptive K-means; simulated annealing data mining; clustering analysis; adaptive K-means; simulated annealing
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Hedar, A.-R.; Ibrahim, A.-M.M.; Abdel-Hakim, A.E.; Sewisy, A.A. K-Means Cloning: Adaptive Spherical K-Means Clustering. Algorithms 2018, 11, 151.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top