Skip to main content

Incremental Sparse Kernel Machine

  • Conference paper
  • First Online:
Artificial Neural Networks — ICANN 2002 (ICANN 2002)

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

Included in the following conference series:

  • 83 Accesses

Abstract

The Relevance Vector Machine (RVM) gives a probabilistic model for a sparse kernel representation. It achieves comparable performance to the Support Vector Machine (SVM) while using substantially fewer kernel bases. However, the computational complexity of the RVM in the training phase prohibits its application to large datasets. In order to overcome this difficulty, we propose an incremental Bayesian method for the RVM. The preliminary experiments showed the efficiency of our method for large datasets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Tipping, M.E. (2000). The Relevance Vector Machine. NIPS 12, pp. 652–658.

    Google Scholar 

  2. Bishop, C. M. & Tipping, M. E. (2000). Variational relevance vector machines. Proc. of 16th Conf. UAI, pp. 46–53.

    Google Scholar 

  3. V. N. Vapnik. (1995). The Nature of Statistical Learning Theory. Springer-Verlag.

    Google Scholar 

  4. Williams, C. K. I. & Rasmussen, C. E. (1996). Gaussian Process for Regression. NIPS 8. pp. 514–520.

    Google Scholar 

  5. Csatò, L. & Opper, M. (2001). Sparse Representation for Gaussian Process Models. NIPS 13.

    Google Scholar 

  6. Attias, H. (1999). Inferring parameters and structure of latent variable models by variational Bayes. Proc. of 15th Conf. UAI, pp. 21–30.

    Google Scholar 

  7. Sato, M. (2001). On-line Model Selection Based on the Variational Bayes. Neural Computation, 13. 1649–1681.

    Article  MATH  Google Scholar 

  8. Rosipal, R. et al. (2001). Kernel PCA for Feature Extraction and De-Noising in Non-linear Regression. Neural Computing & Applications. 10(3).

    Google Scholar 

  9. Chang, C. and Lin, C., (2001), LIBSVM: a library for SVM. (available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.)

  10. Scholköpf, B. et al. (2000). New support vector algorithms. Neural Computation, 12, 1207–1245.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sato, Ma., Oba, S. (2002). Incremental Sparse Kernel Machine. In: Dorronsoro, J.R. (eds) Artificial Neural Networks — ICANN 2002. ICANN 2002. Lecture Notes in Computer Science, vol 2415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46084-5_114

Download citation

  • DOI: https://doi.org/10.1007/3-540-46084-5_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44074-1

  • Online ISBN: 978-3-540-46084-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics