Geodesic
Synthesis of a correct recognition algorithm as a minimal covering construction problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 2, pp. 467-476 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Some methods of constructing correct recognition and classification algorithms, i.e., algorithms which make no mistakes when classifying given control data, are considered. The correct algorithm construction problem is shown to be reducible to thep problem of constructing the minimal covering of a set by a system of subsets. A practical way of constructing a correct algorithm was described. 
@article{ZVMMF_1983_23_2_a21,
     author = {I. V. Isaev},
     title = {Synthesis of a correct recognition algorithm as a minimal covering construction problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {467--476},
     year = {1983},
     volume = {23},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_2_a21/}
}
TY  - JOUR
AU  - I. V. Isaev
TI  - Synthesis of a correct recognition algorithm as a minimal covering construction problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1983
SP  - 467
EP  - 476
VL  - 23
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_2_a21/
LA  - ru
ID  - ZVMMF_1983_23_2_a21
ER  - 
%0 Journal Article
%A I. V. Isaev
%T Synthesis of a correct recognition algorithm as a minimal covering construction problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1983
%P 467-476
%V 23
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_2_a21/
%G ru
%F ZVMMF_1983_23_2_a21
I. V. Isaev. Synthesis of a correct recognition algorithm as a minimal covering construction problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 2, pp. 467-476. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_2_a21/