Abstract
Machine learning is a scientific discipline that is concerned with the design and development of algorithms that allow computers to change behavior based on data, such as from sensor data or databases. They exist a number of authors have applied genetic algorithms (GA) to the problem of K-clustering, where the required number of clusters is known. Various algorithms are used to enable the GAs to cluster and to enhance their performance, but there is little or no comparison between the different algorithms. It is not clear which algorithms are best suited to the clustering problem, or how any adaptions will affect GA performance for differing data sets. In this article we shall compare a number of algorithms of GA appropriate for thek-clustering problem with some distributions of the collections Reuters 21578, including some used for more general grouping problem.
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
Alippi, C., Cucchiara, R.: Cluster partitioning in image analysis classification. In: Proceedings Computer Systems and Software, pp. 139–144. IEEE, Los Alamitos (1992)
Golderg, D.E.: Genetic algorithm in search Optimization and Machine Learning. Addison Wesley Publishing Company, Inc., Reading (1989)
Olson, D., Delen, D.: Advanced Data Mining Techniques. Springer, Heidelberg (2008)
Jones, D., Beltramo, M.: Solving partitioning problems with genetic algorithms. In: Proceedings of the Fourth International Conference on GAs, pp. 442–449. Kauffman, San Francisco (1991)
Falkenauer, E.: The grouping GAs. Statistic and Computer Science, 79–102 (1993)
Bezdek, J.: Pattern recognition with Fuzzy Objetive algorithms, New York (1991)
Bezdek, J.: Genetic algorithm guided clustering. In: Proceeding First Conf. Evolutionary Computation IEEE World Congress on Computational Intelligence, pp. 34–39. IEEE, Los Alamitos (1994)
Bhuyan, J.: A combination of genetic algorithm and simulated evolution techniques for clustering. In: Proceeding of 1995 ACM Computer Science Conference, pp. 127–134 (1995)
Bhuyan, J., Raghavan, V.: Genetic algorithms for clustering with an ordered representation. In: Proceedings of the 4th International Conference on AG, pp. 408–415
Castillo, J.L., del Castillo, F., Gonzales, L.: Feature reduction for document clustering with NZIPF method. In: Proceedings of IADIS e-Society, vol. 25, pp. 205–209 (2009)
Lewis, D.D.: Reuters – 21578 text categorization test collection, http://www.daviddlewis.com/resources/testcollections/reuters21578 (cited July 2009)
Krovi, R.: Genetic algorithms for clustering. In: Proceedings of the 25th Hawaii Internat. Conference on System Sciences. IEEE Comp. Society Press, Los Alamitos (1991)
Fisher, W.D.: On grouping for maximum homogeneity. Journal of the American Statistical Association 53, 789–798 (1958); Cited in [9]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castillo, S.J.L., del Castillo, J.R.F., Sotos, L.G. (2010). Algorithms of Machine Learning for K-Clustering. In: Demazeau, Y., et al. Trends in Practical Applications of Agents and Multiagent Systems. Advances in Intelligent and Soft Computing, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12433-4_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-12433-4_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12432-7
Online ISBN: 978-3-642-12433-4
eBook Packages: EngineeringEngineering (R0)