Abstract
Finding optimal clusterings is a difficult task. Most clustering methods require the number of clusters to be specified in advance, and hierarchical methods typically produce a set of clusterings. In both cases, the user has to select the number of clusters. This paper proposes improvements for a clustering genetic algorithm that is capable of finding an optimal number of clusters and their partitions automatically, based upon numeric criteria. The proposed improvements were designed to enhance the efficiency of a clustering genetic algorithm. The modified algorithms are evaluated in several simulations.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arabie, P., Hubert, L.J.: An Overview of Combinatorial Data Analysis (Chapter 1). In: Arabie, P., Hubert, L.J., DeSoete, G. (eds.) Clustering and Classification. World Scientific, Singapore (1999)
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data – An Introduction to Cluster Analysis. Wiley Series in Probability and Mathematical Statistics (1990)
Liu, G.L.: Introduction to combinatorial mathematics. McGraw-Hill, New York (1968)
Park, Y., Song, M.: A Genetic Algorithm for Clustering Problems. In: Proceedings of the Genetic Programming Conference, July, 1998, University of Wisconsin (1998)
Hruschka, E.R., Ebecken, N.F.F.: A genetic algorithm for cluster analysis, Intelligent Data Analysis (IDA), vol. 7, pp. 15–25. IOS Press, Amsterdam (2003)
Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley & Sons, Chichester (1998)
Everitt, B.S., Landau, S., Leese, M.: Cluster Analysis. Arnold Publishers, London (2001)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley Longmann, Reading (1989)
Witten, I.H., Frank, E.: Data Mining – Practical Machine Learning Tools and Techniques with Java Implementations, USA. Morgan Kaufmann Publishers, San Francisco (2000)
Triola, M.F.: Elementary Statistics, 7th edn. Addison Wesley Longman, Amsterdam (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hruschka, E.R., Campello, R.J.G.B., de Castro, L.N. (2004). Improving the Efficiency of a Clustering Genetic Algorithm. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_86
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive