Escolar Documentos
Profissional Documentos
Cultura Documentos
Supervised Learning
Genetic algorithm apply an evolutionary approach to inductive learning
Applications include scheduling problems such as network routing problems,
TSP and so on
Algorithm
1. Initialize a population P of n elements, often referred to as chromosomes, as
a potential solution
2. Until a specified termination condition is satisfied:
a. Use a fitness function to evaluate each element of the current solution. If
an element passes the fitness criteria, it remains in P
b. The population now contains m elements(m<=n). Use genetic operators
to create (n-m) new elements. Add the new elements to the population
Keep
Population Fitness
Elements Function
Throw
Training
Data
Candidates
for Crossover
& Mutation
Population Income Life Insurance Credit Card Population Income Life Insurance Credit Card
Sex Age Sex Age
Element Range Promotion Insurance Element Range Promotion Insurance
#2 30-40K Yes No Fem 50-59 #1 20-30K No No Fem 50-59
I1
E21
I2 S2
.
P .
.
. E22
instances .
.
.
.
.
.
.
Ip .
Ek1
SK
Ek2
Solutions