A Perceptron Classifier, Its Correctness Proof and a Probabilistic Interpretation

In this paper a fault tolerant probabilistic kernel version with smoothing parameter of Minsky’s perceptron classifier for more than two classes is exhibited and a correctness proof is provided. Moreover it is shown that the resulting classifier approaches optimality. Due to the non-determinism of the algorithm the (approximately) optimal value of a smoothing parameter has to be determined experimentally. The resulting complexity nevertheless allows for an efficient implementation employing for example Java concurrent programming and suitable hardware. In addition a probabilistic interpretation using Bayes Theorem is provided.

[1]  Gys Albertus Marthinus Meiring,et al.  A Review of Intelligent Driving Style Analysis Systems and Related Artificial Intelligence Algorithms , 2015, Sensors.

[2]  Tomaso A. Poggio,et al.  Regularization Networks and Support Vector Machines , 2000, Adv. Comput. Math..

[3]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[4]  W. Krauth,et al.  Learning algorithms with optimal stability in neural networks , 1987 .

[5]  Paul Resnick,et al.  Recommender systems , 1997, CACM.

[6]  D. Signorini,et al.  Neural networks , 1995, The Lancet.

[7]  Bernhard Schölkopf,et al.  A Generalized Representer Theorem , 2001, COLT/EuroCOLT.

[8]  Sophie Ahrens,et al.  Recommender Systems , 2012 .

[9]  Alexander Smola Introduction to Large Margin Classifiers , 2000 .

[10]  Bernd-Jürgen Falkowski PARALLEL IMPLEMENTATION OF CERTAIN NEURAL NETWORK ALGORITHMS , 2008 .

[11]  Igor Kononenko,et al.  Machine learning for medical diagnosis: history, state of the art and perspective , 2001, Artif. Intell. Medicine.

[12]  Nello Cristianini,et al.  Kernel Methods for Pattern Analysis , 2004 .

[13]  Shivani Agarwal,et al.  Generalization Bounds for Ranking Algorithms via Algorithmic Stability , 2009, J. Mach. Learn. Res..

[14]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..

[15]  Amnon Shashua,et al.  Ranking with Large Margin Principle: Two Approaches , 2002, NIPS.

[16]  S. Levin,et al.  On the boundedness of an iterative procedure for solving a system of linear inequalities , 1970 .

[17]  Radford M. Neal Pattern Recognition and Machine Learning , 2007, Technometrics.

[18]  David J. Hand,et al.  Statistical Classification Methods in Consumer Credit Scoring: a Review , 1997 .

[19]  Bernd-Jürgen Falkowski A Perceptron Classifier and Corresponding Probabilities , 2016, SMPS.

[20]  Stephen I. Gallant,et al.  Perceptron-based learning algorithms , 1990, IEEE Trans. Neural Networks.