1988
DOI: 10.1007/bf00113894
|View full text |Cite
|
Sign up to set email alerts
|

Learning with genetic algorithms: An overview

Abstract: Genetic algorithms represent a class of adaptive search techniques that have been intensively studied in recent years. Much of the interest in genetic algorithms is due to the fact that they provide a set of efficient domain-independent search heuristics which are a significant improvement over traditional "weak methods" without the need for incorporating highly doinain-specific knowledge. There is now considerable evidence that genetic algorithms are usefifl for global flmction optimization and NP-hard proble… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
143
0
10

Year Published

1990
1990
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 358 publications
(153 citation statements)
references
References 12 publications
0
143
0
10
Order By: Relevance
“…Over the years GA which is considered to be an inductive searching technique demonstrated substantial improvement [14]. The Feature selection using genetic algorithms are considered to be an excellent choice for improving the performance of the classification system [15].…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Over the years GA which is considered to be an inductive searching technique demonstrated substantial improvement [14]. The Feature selection using genetic algorithms are considered to be an excellent choice for improving the performance of the classification system [15].…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Classically, two genetic learning approaches, adopted from the ÿeld of genetic based machine learning systems, have been used: the Michigan and Pittsburgh approaches [20]. In the past few years, some authors have designed several GFRBSs following a new learning model, the IRL approach [24].…”
Section: The Iterative Rule Learning Approachmentioning
confidence: 99%
“…If that space is well-understood and contains structure that can be exploited by special-purpose search techniques, the use of genetic algorithms is generally computationally less efficient. If the space to be searched is not so well understood and relatively unstructured, and if an effective GA representation of that space can be developed, then GAs provide a surprisingly powerful search heuristic for large, complex spaces (Holland, 1985;De Jong, 1988;Goldberg, 1989).…”
Section: Introductionmentioning
confidence: 99%