Вы здесь ▸ Обсуждение ▸
Мои публикации
Публикации: статьи в журналах и сборниках конференций, доклады, презентации, отчеты, авторские свидетельства.
Ivanov V.K., Palyukh B.V., Sotnikov A.N.
Conformance Evaluation of Genetic Algorithm for Evolutionary Area Search of Canonical Model Journal Article
In: Lobachevskii Journal of Mathematics, vol. 40, no. 11, pp. 1799–1808, 2019, ISSN: 1995-0802.
Abstract | Links | BibTeX | Altmetric | Метки: coding, crossover, defining length, fitness function, genetic algorithm, genotype, Holland’s schema theorem, innovation index, order, query, scheme, subject search
@article{nokey,
title = {Conformance Evaluation of Genetic Algorithm for Evolutionary Area Search of Canonical Model},
author = {Ivanov V.K. and Palyukh B.V. and Sotnikov A.N.},
url = {https://disk.yandex.ru/i/Q42TFMNFM5XGlg},
doi = {10.1134/S1995080219110155},
issn = {1995-0802},
year = {2019},
date = {2019-11-30},
urldate = {2019-11-30},
journal = {Lobachevskii Journal of Mathematics},
volume = {40},
number = {11},
pages = {1799–1808},
publisher = {Pleiades Publishing, Ltd.},
abstract = {The theory and practice of genetic algorithms is largely based on the Schema Theorem. It was formulated for a canonical genetic algorithm and proves its ability to generate a sufficient number of effective schemata of individuals. Genetic algorithms to solve specific problems and to be different from canonical ones have to be checked to find out whether the Schema Theorem evaluates the algorithm fitness. The article validates the way of testing the algorithm developed as a technique of an area search. The methodology and research results are stated consistently. Coding specifics of the search queries are noted, a criterion of the coding method applicability is substantiated. A variant of the genotype geometric coding is proposed. In comparison with other methods of binary search coding, it provides a short code length and uniqueness as well as conforms the formulated criterion of applicability. Supporting experimental results are given. The Schema Theorem is shown to hold with the iterative execution of the genetic algorithm being tested.
},
keywords = {coding, crossover, defining length, fitness function, genetic algorithm, genotype, Holland’s schema theorem, innovation index, order, query, scheme, subject search},
pubstate = {published},
tppubtype = {article}
}
The theory and practice of genetic algorithms is largely based on the Schema Theorem. It was formulated for a canonical genetic algorithm and proves its ability to generate a sufficient number of effective schemata of individuals. Genetic algorithms to solve specific problems and to be different from canonical ones have to be checked to find out whether the Schema Theorem evaluates the algorithm fitness. The article validates the way of testing the algorithm developed as a technique of an area search. The methodology and research results are stated consistently. Coding specifics of the search queries are noted, a criterion of the coding method applicability is substantiated. A variant of the genotype geometric coding is proposed. In comparison with other methods of binary search coding, it provides a short code length and uniqueness as well as conforms the formulated criterion of applicability. Supporting experimental results are given. The Schema Theorem is shown to hold with the iterative execution of the genetic algorithm being tested.
Иванов В.К.
Обоснование и постановка задачи прогнозирования результатов генетического алгоритма Journal Article
In: vol. 8, no. 57, pp. 5-13, 2016.
Abstract | Links | BibTeX | Метки: crossover, data centre, defining length, fitness function, genetic algorithm, genotype, Holland’s schema theorem, order, query, representation, scheme, subject search, генетический алгоритм, генотип, кодирование, кроссинговер, определяющая длина, поисковый запрос, порядок, схема, тематический поиск, теорема Холланда, фитнес-функция
@article{nokey,
title = {Обоснование и постановка задачи прогнозирования результатов генетического алгоритма},
author = {Иванов В.К.},
url = {https://disk.yandex.ru/i/I6iQWk2vOm4p8A
https://cyberleninka.ru/article/n/obosnovanie-i-postanovka-zadachi-prognozirovaniya-rezultatov-geneticheskogo-algoritma/viewer},
year = {2016},
date = {2016-12-31},
urldate = {2016-12-31},
volume = {8},
number = {57},
pages = {5-13},
publisher = {СибАК},
abstract = {В статье обосновывается и формулируется постановка задачи прогнозирования результатов генетического алгоритма, разработанного для выполнения документного тематического поиска. Утверждается необходимость и полезность проверки выполнения теоремы схем Холланда для указанного алгоритма. Отмечены условия корректной проверки, в частности требования к кодированию генотипа запросов и сглаживанию фитнес-функции. Предложен метод кодирования генотипа, который использует расстояние между векторами, представ-ляющими запросы.
Vladimir Ivanov
Rationale Of The Problem With Prediction Of Genetic Algorithm Results
This article presents and explains the problem with prediction of the genetic algorithm results developed to perform a subject document search. The article alleges the necessity and usefulness of the verification Holland's scheme theorem for a specified algorithm. The correct test conditions and requirements including the query genotype representation and smoothing of the fitness function are described. The genotype representation method that uses the distance between vectors is offered.},
keywords = {crossover, data centre, defining length, fitness function, genetic algorithm, genotype, Holland’s schema theorem, order, query, representation, scheme, subject search, генетический алгоритм, генотип, кодирование, кроссинговер, определяющая длина, поисковый запрос, порядок, схема, тематический поиск, теорема Холланда, фитнес-функция},
pubstate = {published},
tppubtype = {article}
}
В статье обосновывается и формулируется постановка задачи прогнозирования результатов генетического алгоритма, разработанного для выполнения документного тематического поиска. Утверждается необходимость и полезность проверки выполнения теоремы схем Холланда для указанного алгоритма. Отмечены условия корректной проверки, в частности требования к кодированию генотипа запросов и сглаживанию фитнес-функции. Предложен метод кодирования генотипа, который использует расстояние между векторами, представ-ляющими запросы.
Vladimir Ivanov
Rationale Of The Problem With Prediction Of Genetic Algorithm Results
This article presents and explains the problem with prediction of the genetic algorithm results developed to perform a subject document search. The article alleges the necessity and usefulness of the verification Holland's scheme theorem for a specified algorithm. The correct test conditions and requirements including the query genotype representation and smoothing of the fitness function are described. The genotype representation method that uses the distance between vectors is offered.
Vladimir Ivanov
Rationale Of The Problem With Prediction Of Genetic Algorithm Results
This article presents and explains the problem with prediction of the genetic algorithm results developed to perform a subject document search. The article alleges the necessity and usefulness of the verification Holland's scheme theorem for a specified algorithm. The correct test conditions and requirements including the query genotype representation and smoothing of the fitness function are described. The genotype representation method that uses the distance between vectors is offered.