Self adaptive genetic algorithms

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Genetic Algorithms(GAs) are efficient and robust searching and optimization methods that are used in data mining. In this chapter, we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This chapter gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification based datamining problems. Michigan style of classifier is used to build the classifier and the system is tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Self adaptive genetic algorithms. (2009). Studies in Computational Intelligence, 190, 19–50. https://doi.org/10.1007/978-3-642-00193-2_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free