Algorithms for finding logical regularities in pattern recognition |
| |
Authors: | N V Kovshov V L Moiseev V V Ryazanov |
| |
Institution: | (1) Moscow Institute of Physics and Technology, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700, Russia;(2) 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. |
| |
Keywords: | logical regularities of class precedent-based recognition estimate evaluation algorithm integer programming genetic algorithm |
本文献已被 SpringerLink 等数据库收录! |
|