Algorithm for choosing conjunctions for logical recognition methods
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 52 (2012) no. 4, pp. 746-749
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
A new family of recognition algorithms for problems with binary information is constructed. A natural method is proposed for ordering conjunctions used in pattern recognition problems in the standard formulation and with binary features.
[1] Vaintsvaig M. N., “Algoritm obucheniya raspoznavaniyu obrazov “kora””, Algoritmy obucheniya raspoznavaniyu obrazov, Sovetskoe radio, M., 1973, 110–116
[2] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya ili klassifikatsii”, Problemy kibernetiki, 33 (1978), 5–68 | Zbl
[3] Dyukova E. V., Inyakin A. S., “O protsedurakh klassifikatsii, osnovannykh na postroenii pokrytii klassov”, Zh. vychisl. matem. i matem. fiz., 43:12 (2003), 1884–1895 | MR | Zbl