วันจันทร์ที่ 1 กันยายน พ.ศ. 2557

CI Chapter 3 by Pro.Chu part2

So today we will continue from last week about Computer Intelligence.
We will begin with crossover there are

Binary representation
:
 o one-point : half and half switch.
 o two-point : random by if n<m choose m if n<m choose n.
 o uniform : each decision variable is independent.

Linear Crossover
 o Select two parents (x1,....,xn) and (y1,...,yn)
 o Select a single gene k at random
 o Generate three offspring
 o Select the best two as the offspring

Generalized Unimodal Distributed (UNDX) Crossover (Ono, 1997)

o find the centroid (it's mean the center of the many point )

Gaussian
or normal distribution : Need to find center point and Standard deviation (SD) if you want to find more answer you need to add more SD if less SD the answer is always will near the centroid.

Next one is Simplex crossover (SPX)  and

Parent- Centric Operator (PCX)
 o Offspring are generated around selected parents
 o Select nu parents
 o Compute the center of the mass
 o Compute direction vector

Next topic is Mutation
- Mutation is asexual reproduction, introducing randomness into the population
Pm : Mutation Probability (Normally we will set Pm in a less number)

Mutation is like crossover, mutation operations depend on representation:
o binary
o integer : Resetting some gene to anew
  ex.  if you represent by random 1 2 3 4 that 1 2 3 4 is N E W S so make new random again by each eqaul

o Real-valued - random with some PDF


Probability Density Functions
  • Gaussian 
  • Cauchy
  • Laplace
  • Logistic
  • Uniform 

 MySimpleDiary

ไม่มีความคิดเห็น:

แสดงความคิดเห็น