Geodesic
Efficient formulas for computing estimates for recognition algorithms with arbitrary systems of support sets
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 11, pp. 1904-1918 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1999_39_11_a9,
     author = {A. G. D'yakonov},
     title = {Efficient formulas for computing estimates for recognition algorithms with arbitrary systems of support sets},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1904--1918},
     year = {1999},
     volume = {39},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_11_a9/}
}
TY  - JOUR
AU  - A. G. D'yakonov
TI  - Efficient formulas for computing estimates for recognition algorithms with arbitrary systems of support sets
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 1904
EP  - 1918
VL  - 39
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_11_a9/
LA  - ru
ID  - ZVMMF_1999_39_11_a9
ER  - 
%0 Journal Article
%A A. G. D'yakonov
%T Efficient formulas for computing estimates for recognition algorithms with arbitrary systems of support sets
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 1904-1918
%V 39
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_11_a9/
%G ru
%F ZVMMF_1999_39_11_a9
A. G. D'yakonov. Efficient formulas for computing estimates for recognition algorithms with arbitrary systems of support sets. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 11, pp. 1904-1918. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_11_a9/

[1] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya ili klassifikatsii”, Probl. kibernetiki, 33, Nauka, M., 1978, 5–68

[2] Gurevich I. B., Zhuravlev Yu. I., “Minimizatsiya bulevykh funktsii i effektivnye algoritmy raspoznavaniya”, Kibernetika, 1974, no. 3, 16–20 | MR | Zbl