Discrete analysis of feature descriptions in recognition problems of high dimensionality
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 8, pp. 1264-1278 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2000_40_8_a10,
     author = {E. V. Dyukova and Yu. I. Zhuravl\"ev},
     title = {Discrete analysis of feature descriptions in recognition problems of high dimensionality},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1264--1278},
     year = {2000},
     volume = {40},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_8_a10/}
}
TY  - JOUR
AU  - E. V. Dyukova
AU  - Yu. I. Zhuravlëv
TI  - Discrete analysis of feature descriptions in recognition problems of high dimensionality
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2000
SP  - 1264
EP  - 1278
VL  - 40
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_8_a10/
LA  - ru
ID  - ZVMMF_2000_40_8_a10
ER  - 
%0 Journal Article
%A E. V. Dyukova
%A Yu. I. Zhuravlëv
%T Discrete analysis of feature descriptions in recognition problems of high dimensionality
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2000
%P 1264-1278
%V 40
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_8_a10/
%G ru
%F ZVMMF_2000_40_8_a10
E. V. Dyukova; Yu. I. Zhuravlëv. Discrete analysis of feature descriptions in recognition problems of high dimensionality. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 8, pp. 1264-1278. http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_8_a10/

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

[2] Rudakov K. V., “Ob algebraicheskoi teorii universalnykh i lokalnykh ogranichenii dlya zadach klassifikatsii”, Raspoznavanie, klassifikatsiya, prognoz, Nauka, M., 1989, 176–201 | MR

[3] Andreev A. E., “Nekotorye voprosy testovogo raspoznavaniya obraztsov”, Dokl. AN SSSR, 255:4 (1981), 781–784

[4] Aslanyan L. A., “Ob odnom metode raspoznavaniya, osnovannom na razdelenii klassov diz'yunktivnymi normalnymi formami”, Kibernetika, 1975, no. 5, 103–110 | Zbl

[5] Baskakova L. V., Zhuravlev Yu. I., “Model raspoznayuschikh algoritmov s predstavitelnymi naborami i sistemami opornykh mnozhestv”, Zh. vychisl. matem. i matem. fiz., 21:5 (1981), 1264–1275 | MR | Zbl

[6] Bushmanov O. N., Klass algoritmov raspoznavaniya, osnovannyi na poiske empiricheskikh zakonomernostei, VTs RAN, M., 1992

[7] Vaintsvaig M. N., “Algoritm obucheniya raspoznavaniyu obrazov “Kora””, Algoritmy obucheniya raspoznavaniyu obrazov, Sov. radio, M., 1973, 82–91

[8] Dmitriev A. I., Zhuravlev Yu. I., Krendelev F. P., “O matematicheskikh printsipakh klassifikatsii predmetov ili yavlenii”, Diskretnyi analiz, 7, IM SO AN SSSR, Novosibirsk, 1966, 3–17

[9] Dyukova E. V., “Ob odnom algoritme postroeniya tupikovykh testov dlya binarnykh tablits”, Sbornik rabot po diskretnoi matematike, 1, VTs AN SSSR, M., 1976, 167–185

[10] Dyukova E. V., “Ob asimptoticheski optimalnom algoritme postroeniya tupikovykh testov”, Dokl. AN SSSR, 233:4 (1977), 527–530 | MR | Zbl

[11] Dyukova E. V., “Asimptoticheski optimalnye testovye algoritmy v zadachakh raspoznavaniya”, Probl. kibernetiki, 39, Nauka, M., 1982, 165–199 | MR

[12] Dyukova E. V., “O slozhnosti realizatsii nekotorykh protsedur raspoznavaniya”, Zh. vychisl. matem. i matem. fiz., 27:1 (1987), 114–127 | MR | Zbl

[13] Dyukova E. V., “Algoritmy raspoznavaniya tipa “Kora”: slozhnost realizatsii i metricheskie svoistva”, Raspoznavanie, klassifikatsiya, prognoz (matem. metody i ikh primenenie), 2, Nauka, M., 1989, 99–125 | MR

[14] Dyukova E. V., “O reshenii sistem bulevykh uravnenii kvazinelsonovskogo tipa”, Vopr. kibernetiki. Diskretnaya matem. Metody i primenenie, AN SSSR. Nauchn. Sovet po kompleksnoi probleme “Kibernetika”, M., 1989, 5–19 | MR

[15] Dyukova E. V., “Asimptoticheskie otsenki nekotorykh kharakteristik mnozhestva predstavitelnykh naborov i zadacha ob ustoichivosti”, Zh. vychisl. matem. i matem. fiz., 35:1 (1995), 122–134 | MR | Zbl

[16] Konstantinov P. M., Korolev Z. E., Kudryavtsev V. B., “O kombinatorno-logicheskom podkhode k zadacham prognoza rudonosnosti”, Probl. kibernetiki, 30, Nauka, M., 1975, 5–33

[17] Kuznetsov V. E., “Ob odnom stokhasticheskom algoritme vychisleniya informativnykh kharakteristik tablits po metodu testov”, Diskretnyi analiz, 23, IM SO AN SSSR, Novosibirsk, 1973, 8–23

[18] Noskov V. N., Slepyan V. A., “O chisle tupikovykh testov dlya odnogo klassa tablits”, Kibernetika, 1972, no. 1, 60–65 | MR | Zbl

[19] Djukova E. V., Zhuravlev Yu. I., “Diskrete methods of information analysis and algorithm synthesis”, J. Pattern Recognition and Image Analysis., 7:2 (1997), 192–207

[20] Chegis I. A., Yablonskii S. V., “Logicheskie sposoby kontrolya elektricheskikh skhem”, Tr. MIAN SSSR, 51, M., 1958, 270–360 | Zbl

[21] S. V. Yablonskii, O. B. Lupanov (red.), Diskretnaya matematika i matematicheskie voprosy kibernetiki, Nauka, M., 1974

[22] Noskov V. N., Slepyan V. A., “O chisle tupikovykh testov dlya odnogo klassa tablits”, Kibernetika, 1972, no. 1, 60–65 | MR | Zbl

[23] Slepyan V. A., “O chisle tupikovykh testov i o merakh informativnosti stolbtsa dlya pochti vsekh binarnykh tablits”, Dokl. AN SSSR, 297:1 (1987), 43–46