Test recognition theory
Diskretnaya Matematika, Tome 18 (2006) no. 3, pp. 3-34.

Voir la notice de l'article provenant de la source Math-Net.Ru

We describe the logic approach to pattern recognition; its key notion is a test. Analysing the tests allows us to construct functionals characterising the pattern, as well as procedures to compute them. We present qualitative and quantitative properties of tests, functionals, and recognition procedures. Solutions of a series of known problems are also given.
@article{DM_2006_18_3_a0,
     author = {V. B. Kudryavtsev},
     title = {Test recognition theory},
     journal = {Diskretnaya Matematika},
     pages = {3--34},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2006_18_3_a0/}
}
TY  - JOUR
AU  - V. B. Kudryavtsev
TI  - Test recognition theory
JO  - Diskretnaya Matematika
PY  - 2006
SP  - 3
EP  - 34
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2006_18_3_a0/
LA  - ru
ID  - DM_2006_18_3_a0
ER  - 
%0 Journal Article
%A V. B. Kudryavtsev
%T Test recognition theory
%J Diskretnaya Matematika
%D 2006
%P 3-34
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2006_18_3_a0/
%G ru
%F DM_2006_18_3_a0
V. B. Kudryavtsev. Test recognition theory. Diskretnaya Matematika, Tome 18 (2006) no. 3, pp. 3-34. http://geodesic.mathdoc.fr/item/DM_2006_18_3_a0/

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

[2] Krendelev F. P., Dmitriev A. N., Zhuravlev Yu. I., “Sravnenie geologicheskogo stroeniya zarubezhnykh mestorozhdenii dokembriiskikh konglomeratov s pomoschyu diskretnoi matematiki”, Dokl. AN SSSR, 173:5 (1967), 1149–1152

[3] Shaeb A., Issledovanie svoistv lineinykh metricheskikh algoritmov raspoznavaniya, Kand. diss., MGU, 1958

[4] Konstantinov R. M., Koroleva Z. E., Kudryavtsev V. B., “Kombinatorno-logicheskii podkhod k zadacham prognoza rudonosnosti”, Problemy kibernetiki, 31 (1976), 25–41

[5] Nefidov F. N., Postroenie modeli lecheniya detei s nekotorymi ostrymi zabolevaniyami bryushnoi polosti, Kand. diss., VTs AN SSSR, 1977

[6] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya i klassifikatsii”, Problemy kibernetiki, 33 (1978), 5–68 | Zbl

[7] Slepyan V. A., “Parametry raspredeleniya tupikovykh testov i informatsionnye vesa stolbtsov v binarnykh tablitsakh”, Diskretnyi analiz, 14, 1969, 28–43 | Zbl

[8] Noskov V. N., “O slozhnosti testov, kontroliruyuschikh rabotu vkhodov logicheskikh skhem”, Matem. zametki, 18:1 (1975), 137–150 | MR | Zbl

[9] Dyukova E. V., Asimptoticheski optimalnye testovye algoritmy v zadachakh raspoznavaniya, Kand. diss., VTs AN SSSR, 1979

[10] Andreev A. E., O kachestvennykh i metricheskikh svoistvakh testovykh algoritmov, Kand. diss., MGU, 1981

[11] Kibkalo A. A., O $T$-algoritmakh raspoznavaniya, ispolzuyuschikh korotkie testy, Kand. diss., MGU, 1988

[12] Kuznetsov V. E., “Ob odnom stokhasticheskom algoritme vychisleniya informatsionnykh kharakteristik tablits po metodu testov”, Diskretnyi analiz, 23, 1973, 8–23 | Zbl

[13] Nosov M. V., Funktsionalnye kharakteristiki testovykh algoritmov raspoznavaniya obrazov, Kand. diss., MGU, 1989

[14] Pogosyan G. R., O slozhnosti proveryayuschikh testov dlya logicheskikh ustroistv, Kand. diss., VTs AN SSSR, 1982

[15] Dolotova O. A., O slozhnosti kontrolya logicheskikh skhem tipa Posta, Kand. diss., VTs AN SSSR, 1991

[16] Solovev N. A., Testy (teoriya, postroenie, primenenie), Nauka, Novosibirsk, 1978 | MR

[17] Yablonskii S. V., Gavrilov G. P., Kudryavtsev V. B., Funktsii algebry logiki i klassy Posta, Nauka, Moskva, 1966 | MR | Zbl