Abstract
One of the most challenging problems in data clustering is to determine the number of clusters. This study intends to propose an improved differential evolution algorithm which integrates automatic clustering based differential evolution (ACDE) algorithm and k-means (ACDE-k-means) algorithm. It requires no prior knowledge about number of clusters. k-means algorithm is employed to tune cluster centroids in order to improve the performance of DE algorithm. To validate the performance of the proposed algorithm, two well-known data sets, Iris and Wine, are employed. The computational results indicate that the proposed ACDE-k-means algorithm is superior to classical DE algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bandyopadhyay S, Maulik U (2002) Genetic clustering for automatic evolution of cluster and application to image classification. Pattern Recogn 35:1197–1208
Cai D, Xiaofei H, Han J (2005) Documents clustering using locality preserving indexing. Knowl Data Eng IEEE Tran 17(12):1624–1637
Chou C-H, Su M-C, Lai E (2004) A new cluster validity measure and its application to image compression. Patter Anal Applic 7:205–220
Das S, Abraham A, Komar A (2008) Automatic clustering using improved differential evolution algorithm. IEEE Trans Syst Man Cybern Part A 38:218–237
Frigui H, Krishnapuram R (1999) A robust competitive clustering algorithm with applications in computer vision. IEEE Trans Pattern Anal Mach Intell 21:450–465
Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv (CSUR) 31(3):264–323
Kuo RJ, Akbaria K, Subroto B (2012a) Application of particle swarm optimization and perceptual map to tourist market segmentation. Expert Syst App 39:8726–8735
Kuo RJ, Syu YJ, Chen ZY, Tien FC (2012b) Integration of particle swarm optimization and genetic algorithm for dynamic clustering. Inf Sci 195:124–140
Kwedlo W (2011) A clustering method combining differential evolution with the k-means algorithms. Pattern Recognit Lett 32:1613–1621
Macqueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley Symposium on mathematical statistics and probability, vol 1, pp 281–297
Paterlini S, Krink T (2006) Differential evolution and particle swarm optimization in partitional clustering. Comput Stat Data Anal 50:1220–1247
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341–359
Yeung KY, Fraley C, Murua A, Raftery AE, Ruzzo WL (2001) Model-based clustering and data transformations for gene expression data. Bioinformatics 17:977–987
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Singapore
About this paper
Cite this paper
Kuo, R.J., Suryani, E., Yasid, A. (2013). Automatic Clustering Combining Differential Evolution Algorithm and k-Means Algorithm. In: Lin, YK., Tsao, YC., Lin, SW. (eds) Proceedings of the Institute of Industrial Engineers Asian Conference 2013. Springer, Singapore. https://doi.org/10.1007/978-981-4451-98-7_143
Download citation
DOI: https://doi.org/10.1007/978-981-4451-98-7_143
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-4451-97-0
Online ISBN: 978-981-4451-98-7
eBook Packages: EngineeringEngineering (R0)