Abstract
Heuristic methods for the rejection of noisy training examples in the support vector machine (SVM) are introduced. Rejection of training errors, either offline or online, rsults in a sparser model that is less affected by noisy data. A simple offline heuristic provides sparser models with similar generalization performance to the standard SVM, at the expense of longer training times. An online approximation of this heuristic reduces training time and provides a sparser model than the SVM with a slight decrease in generalization performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mitchell, T.: Machine Learning. McGraw-Hill International (1997)
Vapnik, V.: Statistical Learning Theory. John Wiley & Sons (1998)
Burges, C. J. C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2 (1998) 1–47
Schölkopf, B., Sung, K. K., Burges, C., Girosi, F., Niyogi, P., Poggio, T., Vapnik, V.: Comparing support vector machines with Gaussian kernels to radial basis function classifiers. IEEE Transactions on Signal Processing 45 (1997)
Cristianini, N., Shawe-Taylor, J.: Support Vector Machines. Cambridge University Press (2000)
Littlestone, N., Warmuth, M.: Relating data compression and learnability. Technical report, University of California, Santa Cruz (1986)
Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review 65 (1959) 386–408
Bishop, C.: Neural Networks for Pattern Recognition. Clarendon Press (1995)
Hsu, C. W., Lin, C. J.: A simple decomposition method for support vector machines. Machine Learning (2001) To appear.
Joachims, T.: Making large-scale SVM learning practical. In Schölkopf, B., Burges, C., Smola, A., eds.: Advances in Kernel Methods: Support Vector Learning. The MIT Press (1999)
Blake, C. L., Merz, C. J.: UCI repository of machine learning databases. (1998)
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
Burbidge, R., Trotter, M., Buxton, B., Holden, S. (2001). STAR - Sparsity through Automated Rejection. In: Mira, J., Prieto, A. (eds) Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence. IWANN 2001. Lecture Notes in Computer Science, vol 2084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45720-8_78
Download citation
DOI: https://doi.org/10.1007/3-540-45720-8_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42235-8
Online ISBN: 978-3-540-45720-6
eBook Packages: Springer Book Archive