Correctness of the linear closure of hyperplane-based recognition algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 10, pp. 1885-1904
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
A theorem concerning the correctness of the linear closure of the set of recognition algorithms based on the separation of objects by hyperplanes is proved.
[1] Zhuravlev Yu. I., “Korrektnye algebry nad mnozhestvami nekorrektnykh (evristicheskikh) algoritmov. I”, Kibernetika, 1977, no. 4, 5–17
[2] Ilin V. A., Kim T. D., Lineinaya algebra i analiticheskaya geometriya, Izd-vo MGU, M., 2002