M3 Flashcards

1
Q

Genetic Algorithm is part of the broader soft computing paradigm known as ___

A

evolutionary computation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Genetic Algorithm was first introduced by Holland in ___

A

1975

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Genetic Algorithm methodology is particularly suited for ___

A

optimization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

In genetic algorithm, a population of candidate solutions are repeatedly altered until an ___ is found

A

optimal solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The step 2 of genetic algorithm is to select a population of better solutions (next generation) by using a ___ (fitness evaluation function)

A

measure of goodness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

In genetic algorithm, a series of genes, known as a __, represents one possible solution

A

chromosome

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

In genetic algorithm, each gene in the chromosome represents one ___ of the solution pattern.

A

component

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

In GA, each gene can have one of a number of possible values known as ___

A

alleles

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

In GA, the process of converting a solution from its original form into a chromosome is known as ____.

A

coding

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

In GA, the most common form of representing a solution as a chromosome is a string of ___ digits (aka a ___ vector)

A

binary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

In GA, solution bit strings are ___ to enable their evaluation using a fitness measure

A

decoded

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

In GA, only the fittest survive and contribute to the gene ___ of the next generation

A

pool

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

In GA, each chromosome’s likelihood of being selected is ___ to its fitness value.

A

proportional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

In GA, solutions failing selection are “___”, and are discarded

A

bad

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

___refines good solutions from current generation to produce next generation of solutions

A

Alteration

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

___ is done by splicing two chromosomes at a crossover point and swapping the spliced parts

17
Q

Crossover is done by splicing two chromosomes at a ___and swapping the spliced parts

A

crossover point

18
Q

Crossover carried out with a probability – typically ___

19
Q

Chromosomes not crossed over are ___

20
Q

___ is a random adjustment in the genetic composition

21
Q

In mutation, probability are kept ___: typically 0.001 to 0.01

22
Q

Mutation are may be ___

A

counterproductive

23
Q

In GA, binary bit strings can produce “__” chromosomes needing repair

24
Q

There was an increasing number of industrial and business applications of GA since late ___

25
Q

___ project in Europe demonstrated potential of GA technology in a broad range of business applications including
o Insurance risk assessment
o Economic modelling
o Credit scoring
o Direct marketing

26
Q

___ is an investment firm in California that started using GA technique in 1993

A

First Quadrant

27
Q

GA can act as an alternative to ___ if
o number of rules is too large or
o the nature of the knowledge-base too dynamic

A

Expert Systems

28
Q

___ are regions that hold good solutions relative to regions around them, but which do not necessarily contain the best overall solutions

A

Local maxima

29
Q

A GA is said to have converged prematurely if it explores a ___ extensively

A

local maximum

30
Q

In GA, most significant factor leading to premature convergence is a ___ which is too slow

A

mutation rate

31
Q

___ happens when the mutation rate is too high. GAs change too often and can’t hold onto good solutions — they get lost.

A

Mutation Interference