Introduction of a sectioned genetic algorithm for large scale problems

The sectioned genetic algorithm (hereafter denoted as sectioned GA), which is presented in this paper, represents a modification of the standard GA and deals with large scale problems (i.e. problems involving pattern spaces with high dimensionalities). Instead of increasing the size of the populatio...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2007 2nd Bio-Inspired Models of Network, Information and Computing Systems s. 2 - 7
Hlavní autori: Detorakis, Z., Tambouratzis, G.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2007
Predmet:
Gallium
Genetic algorithms
Genetics
Histograms
input space dimensionality
masks
parallel distributed algorithms
Program processors
Speech processing
stemming
Training
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The sectioned genetic algorithm (hereafter denoted as sectioned GA), which is presented in this paper, represents a modification of the standard GA and deals with large scale problems (i.e. problems involving pattern spaces with high dimensionalities). Instead of increasing the size of the population searching the pattern space when the problem dimensionality increases, the sectioned GA approach divides each individual into smaller parts (sections) and subsequently applies the genetic operators on each of these parts. Results from the application of sectioned GA on the problem of automatic morphological analysis are also presented in this article. Morphological analysis is by nature a large scale problem since a great number of words need to be segmented into stems and suffixes. The proposed system improves the segmentation accuracy substantially in comparison to standard GA algorithms.
DOI:10.1109/BIMNICS.2007.4610072