Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Anderberg (1973)
Cluster Analysis for Applications
Anil Jain, R. Dubes (1988)
Algorithms for Clustering Data
Fuyuan Cao, Jiye Liang, Guang Jiang (2009)
An initialization method for the K-Means algorithm using neighborhood modelComput. Math. Appl., 58
Anil Jain, M. Murty, P. Flynn (1999)
Data clustering: a reviewACM Comput. Surv., 31
Feng Bo, H. Wen-ning, Chen Gang, Zhang Donghui (2013)
Optimization to K-means initial cluster centersComputer Engineering and Applications, 49
Shehroz Khan, A. Ahmad (2004)
Cluster center initialization algorithm for K-means clusteringPattern Recognit. Lett., 25
Luo Jun-fen (2014)
A Density Based k-means Clustering AlgorithmMicroelectronics & Computer
Purpose – It is well known that the selection of initial cluster centers can significantly affect K-means clustering results. The purpose of this paper is to propose an improved, efficient methodology to handle such a challenge. Design/methodology/approach – According to the fact that the inner-class distance among samples within the same cluster is supposed to be smaller than the inter-class distance among clusters, the algorithm will dynamically adjust initial cluster centers that are randomly selected. Consequently, such adjusted initial cluster centers will be highly representative in the sense that they are distributed among as many samples as possible. As a result, local optima that are common in K-means clustering can then be effectively reduced. In addition, the algorithm is able to obtain all initial cluster centers simultaneously (instead of one center at a time) during the dynamic adjustment. Findings – Experimental results demonstrate that the proposed algorithm greatly improves the accuracy of traditional K-means clustering results and, in a more efficient manner. Originality/value – The authors presented in this paper an efficient algorithm, which is able to dynamically adjust initial cluster centers that are randomly selected. The adjusted centers are highly representative, i.e. they are distributed among as many samples as possible. As a result, local optima that are common in K-means clustering can be effectively reduced so that the authors can achieve an improved clustering accuracy. In addition, the algorithm is a cost-efficient one and the enhanced clustering accuracy can be obtained in a more efficient manner compared with traditional K-means algorithm.
Engineering Computations: International Journal for Computer-Aided Engineering and Software – Emerald Publishing
Published: Oct 28, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.