Abstract
Application of Linear Programming for binary perceptron learning allows reaching theoretical maximum loading of the perceptron that had been predicted by E. Gardner. In the present paper the idea of learning using Linear Programming is extended to vector multistate neural networks. Computer modeling shows that the probability of false identification for the proposed learning rule decreases by up to 50 times compared to the Hebb one. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Kryzhanovskiy, V., Zhelavskaya, I., & Fonarev, A. (2012). Vector perceptron learning algorithm using linear programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7553 LNCS, pp. 197–204). https://doi.org/10.1007/978-3-642-33266-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
