Incremental Sparse Kernel Machine

  • Authors:
  • Masa-aki Sato;Shigeyuki Oba

  • Affiliations:
  • -;-

  • Venue:
  • ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

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 complexityof 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 preliminaryexp eriments showed the efficiencyof our method for large datasets.