Skip to main content

STAR - Sparsity through Automated Rejection

  • Conference paper
  • First Online:
Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence (IWANN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2084))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Mitchell, T.: Machine Learning. McGraw-Hill International (1997)

    Google Scholar 

  2. Vapnik, V.: Statistical Learning Theory. John Wiley & Sons (1998)

    Google Scholar 

  3. Burges, C. J. C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2 (1998) 1–47

    Article  Google Scholar 

  4. 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)

    Google Scholar 

  5. Cristianini, N., Shawe-Taylor, J.: Support Vector Machines. Cambridge University Press (2000)

    Google Scholar 

  6. Littlestone, N., Warmuth, M.: Relating data compression and learnability. Technical report, University of California, Santa Cruz (1986)

    Google Scholar 

  7. Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review 65 (1959) 386–408

    Article  Google Scholar 

  8. Bishop, C.: Neural Networks for Pattern Recognition. Clarendon Press (1995)

    Google Scholar 

  9. Hsu, C. W., Lin, C. J.: A simple decomposition method for support vector machines. Machine Learning (2001) To appear.

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Blake, C. L., Merz, C. J.: UCI repository of machine learning databases. (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics