Abstract
A real world problem (identifying users of body lotion from the answers given in a questionaire) is treated using a linear discriminant and a modified fault tolerant perceptron learning algorithm (pocket algorithm). As was to be expected, a fairly large error rate, which may nevertheless be acceptable for practical purposes, is obtained. A comparison with classical statistical methods (binary logistic regression) shows that the pocket algorithm does not perform as well as was previously predicted in general.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bühl, A.; Zöfel, P.: Einführung in die moderne Datenanalyse unter Windows. Addison-Wesley, (2000)
Christianini, N.; Shawe-Taylor, J.: An Introduction to Support Vector Machines and other Kernel-Based Learning Methods. Cambridge University Press, (2000)
Cover, T.M.: Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Transactions on Electronic Computers, 14, (1965), pp. 326–334
Gallant; S.I.: Perceptron-based Learning Algorithms. IEEE Transactions on Neural Networks, Vol. I,No. 2, (1990), pp. 179–191
Haykin, S.: Neural Networks,.2nd edition, Prentice Hall, (1999)
Ripley, B.D.: Pattern Recognition and Neural Networks. Cambridge University Press, (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Falkowski, B.J., Nietzschmann, J. (2001). Can Perceptrons Identify Users of Body Lotion?. In: Reusch, B. (eds) Computational Intelligence. Theory and Applications. Fuzzy Days 2001. Lecture Notes in Computer Science, vol 2206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45493-4_55
Download citation
DOI: https://doi.org/10.1007/3-540-45493-4_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42732-2
Online ISBN: 978-3-540-45493-9
eBook Packages: Springer Book Archive