Abstract
Data clustering is one of the fundamental tools in data mining and requires the grouping of a dataset into a specified number of nonempty and disjoint subsets. Beside the usual partitional and hierarchical methods, evolutionary algorithms are employed for clustering as well. They are able to find good quality partitions of the dataset and successfully solve some of the shortcomings that the k-means, being one of the most popular partitional algorithms, exhibits. This paper proposes a differential evolution algorithm that includes macromutations as an additional exploration mechanism. The application probability and the intensity of the macromutations are dynamically adjusted during runtime. The proposed algorithm was compared to four variants of differential evolution and one particle swarm optimization algorithm. The experimental analysis conducted on a number of real datasets showed that the proposed algorithm is stable and manages to find high quality solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jain, A.K.: Data clustering: 50 years beyond K-means. Pattern Recogn. Lett. 31, 651–666 (2010)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31, 264–323 (1999)
Murtagh, F., Contreras, P.: Algorithms for hierarchical clustering: an overview. WIREs Data Mining Knowl. Discov. 2, 86–97 (2012)
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)
Hruschka, E.R., Campello, R.J.G.B., Freitas, A.A., De Carvalho, A.C.P.L.F.: A survey of evolutionary algorithms for clustering. IEEE Trans. Sys. Man Cyber. Part C 39, 133–155 (2009)
Laszlo, M., Mukherjee, S.: A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recogn. Lett. 28, 2359–2366 (2007)
Kwedlo, W.: A clustering method combining differential evolution with the K-means algorithm. Pattern Recogn. Lett. 32, 1613–1621 (2011)
Hatamlou, A., Abdullah, S., Nezamabadi-pour, H.: A combined approach for clustering based on k-means and gravitational search algorithms. Swarm Evol. Comput. 6, 47–52 (2012)
Chuang, L.Y., Lin, Y.D., Yang, C.H.: An Improved Particle Swarm Optimization for Data Clustering. In: International MultiConference of Engineers and Computer Scientists, Hong Kong, vol. 1 (2012)
Zou, W., Zhu, Y., Chen, H., Sui, X.: A Clustering Approach Using Cooperative Artificial Bee Colony Algorithm. Discret. Dyn. Nat. Soc., 16 pages (2010)
Paterlini, S., Krink, T.: Differential evolution and particle swarm optimisation in partitional clustering. Comput. Stat. Data Anal. 50, 1220–1247 (2006)
Verdramin, L., Campello, R.J.G.B., Hruschka, E.R.: Relative Clustering Validity Criteria: A Comparative Overview. Stat. Anal. Data Min. 3, 209–235 (2010)
Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. 1, 224–227 (1979)
Storn, R., Price, K.: Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. J. Glob. Optim. 11, 342–359 (1997)
Das, S., Suganthan, P.N.: Differential evolution: A survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15, 4–31 (2011)
Jones, T.: Crossover, Macromutation, and Population-based Search. In: 6th International Conference on Genetic Algorithms, pp. 73–80. Morgan Kaufmann, San Francisco (1995)
Bache, K., Lichman, M.: UCI Machine Learning Repository. School of Information and Computer Sciences, University of California, http://archive.ics.uci.edu/ml
Pal, S.K., Dutta Majumder, D.: Fuzzy sets and decision making approaches in vowel and speaker recognition. IEEE Trans. Syst., Man, Cybern. 7, 625–629 (1977)
Zhan, Z.-H., Zhang, J.: Enhance Differential Evolution with Random Walk. In: 14th International Conference on Genetic and Evolutionary Computation Conference Companion, pp. 1513–1514. ACM, New York (2012)
Das, S., Abraham, A., Konar, A.: Automatic Clustering Using an Improved Differential Evolution Algorithm. IEEE Trans. Sys. Man Cyber. Part A 38, 218–237 (2008)
Das, S., Konar, A.: Automatic image pixel clustering with an improved differential evolution. Appl. Soft Comput. 9, 226–236 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Martinović, G., Bajer, D. (2013). Data Clustering with Differential Evolution Incorporating Macromutations. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2013. Lecture Notes in Computer Science, vol 8297. Springer, Cham. https://doi.org/10.1007/978-3-319-03753-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-03753-0_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03752-3
Online ISBN: 978-3-319-03753-0
eBook Packages: Computer ScienceComputer Science (R0)