Geodesic
Recognition of relations by the method of collective vote
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 3 (2011), pp. 154-162 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We investigate the methods of presenting relationships by using Rademacher's predicates and offer a method of collective voting to recognize relationships.
Keywords: Rademacher predicate, finite relations, model signature, completeness, training sample. 
@article{VUU_2011_3_a13,
     author = {N. I. Kalyadin},
     title = {Recognition of relations by the method of collective vote},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {154--162},
     year = {2011},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2011_3_a13/}
}
TY  - JOUR
AU  - N. I. Kalyadin
TI  - Recognition of relations by the method of collective vote
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2011
SP  - 154
EP  - 162
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VUU_2011_3_a13/
LA  - ru
ID  - VUU_2011_3_a13
ER  - 
%0 Journal Article
%A N. I. Kalyadin
%T Recognition of relations by the method of collective vote
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2011
%P 154-162
%N 3
%U http://geodesic.mathdoc.fr/item/VUU_2011_3_a13/
%G ru
%F VUU_2011_3_a13
N. I. Kalyadin. Recognition of relations by the method of collective vote. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 3 (2011), pp. 154-162. http://geodesic.mathdoc.fr/item/VUU_2011_3_a13/

[1] Belousov V. A., Kalyadin N. I., “Konechnye modeli i ikh primenenie k postroeniyu klassifikatorov otnoshenii posledovatelno-parallelnogo deistviya”, Diskretnye sistemy obrabotki informatsii, 5, IMI, Izhevsk, 1983, 83–88

[2] Gorelik A. L., Skripkin V. A., Metody raspoznavaniya, Vysshaya shkola, M., 1977, 222 pp. | MR

[3] Vasilev V.I., Raspoznayuschie sistemy, Spravochnik, Naukova dumka, Kiev, 1969, 169 pp.

[4] Belousov V. A., Kalyadin N. I., “Otnositelnaya polnota v konechnykh modelyakh”, Diskretnye sistemy obrabotki informatsii, 10, IMI, Izhevsk, 1990, 5–12

[5] Belousov V. A., Kalyadin N. I., “Otnositelnaya polnota v konechnykh modelyakh”, X Vsesoyuz. konf. po matematicheskoi logike, Tez. dokl., Alma-Ata, 1990, 21

[6] Belousov V. A., Kalyadin N. I., “Svyaz mezhdu tochechnymi predikatami Rademakhera”, XI Mezhrespubl. konf. po matematicheskoi logike, Kazan, 1992, 20

[7] Glushkov V. M., Vvedenie v kibernetiku, Izd-vo AN USSR, Kiev, 1964, 324 pp. | MR

[8] Maltsev A. I., Algoritmy i rekursivnye funktsii, Nauka, M., 1965, 392 pp. | MR

[9] Kalyadin N. I., Murynov A. I., “Ob effektivnosti razlichnykh podkhodov v raspoznavanii obrazov”, Avtomaticheskie ustroistva ucheta i kontrolya, 12, IMI, Izhevsk, 1977, 3–5