Stability of a model of pattern recognition algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 1, pp. 191-197
Cet article a éte moissonné depuis la source Math-Net.Ru
A family of recognition algorithms with generalized standards is investigated, and the validity of its linear closure is proved. A concept of algorithm stability in recognition problems is introduced, and the sufficient conditions for stability are given. It is shown that a correct algorithm belonging to the family considered is stable.
@article{ZVMMF_1983_23_1_a21,
author = {S. I. Kashkevich and V. V. Krasnoproshin},
title = {Stability of a model of pattern recognition algorithms},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {191--197},
year = {1983},
volume = {23},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a21/}
}
TY - JOUR AU - S. I. Kashkevich AU - V. V. Krasnoproshin TI - Stability of a model of pattern recognition algorithms JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1983 SP - 191 EP - 197 VL - 23 IS - 1 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a21/ LA - ru ID - ZVMMF_1983_23_1_a21 ER -
S. I. Kashkevich; V. V. Krasnoproshin. Stability of a model of pattern recognition algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 1, pp. 191-197. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a21/