Predicate description of universal constraints in the algebraic approach to pattern recognition problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 47 (2007) no. 3, pp. 547-552
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
By using the algebraic approach to pattern recognition problems and the theory of local and universal constraints, universal constraints are described as sets of mappings that preserve $m$-place predicates. It is shown that symmetric and functional constraints admit a similar description.
[1] Rudakov K. V., “Ob algebraicheskoi teorii universalnykh i lokalnykh ogranichenii dlya zadach klassifikatsii”, Raspoznavanie, klassifikatsiya, prognoz, v. 1, Nauka, M., 1989, 176–201 | MR
[2] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya ili klassifikatsii”, Probl. kibernetiki, 33 (1979), 5–68
[3] Rudakov K. V., “O simmetricheskikh i funktsionalnykh ogranicheniyakh dlya algoritmov klassifikatsii”, Dokl. AN SSSR, 297:1 (1987), 43–46 | MR