|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2008, Volume 48, Number 2, Pages 329–344
(Mi zvmmf188)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Algorithms for finding logical regularities in pattern recognition
N. V. Kovshova, V. L. Moiseeva, V. V. Ryazanovb a Moscow Institute of Physics and Technology, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700, Russia
b Dorodnicyn Computing Center, Russian Academy of Sciences,
ul. Vavilova 40, Moscow, 119991, Russia
Abstract:
Three algorithms for finding logical regularities of classes in the precedent-based recognition problem are proposed. Logical regularities of classes are defined as conjunctions of special oneplace predicates that determine the membership of a value of a feature in a certain interval of the real axis. The conjunctions are true on as large subsets of reference objects of a certain class as possible. The problem of finding logical regularities is formulated as a special integer programming problem. Relaxation, genetic, and combinatorial algorithms are proposed for solving this problem. Comparison results for these algorithms using model and real-time problems are presented. Comparison results for various estimate evaluation recognition algorithms that use logical regularities of classes in voting procedures are also presented.
Key words:
logical regularities of class, precedent-based recognition, estimate evaluation algorithm, integer programming, genetic algorithm.
Received: 16.08.2007
Citation:
N. V. Kovshov, V. L. Moiseev, V. V. Ryazanov, “Algorithms for finding logical regularities in pattern recognition”, Zh. Vychisl. Mat. Mat. Fiz., 48:2 (2008), 329–344; Comput. Math. Math. Phys., 48:2 (2008), 314–328
Linking options:
https://www.mathnet.ru/eng/zvmmf188 https://www.mathnet.ru/eng/zvmmf/v48/i2/p329
|
|