The Bayesian Committee Support Vector Machine

Anton Schwaighofer and Volker Tresp

Abstract

Empirical evidence indicates that the training time for the support vector machine (SVM) scales to the square of the number of training data points. In this paper we introduce the Bayesian committee support vector machine (BC-SVM) and achieve an algorithm for training the SVM which scales linearly in the number of training data. We verify the good performance of the BC-SVM using several data sets.

Details

Publication typeInproceedings
Published inArtificial Neural Networks – ICANN 2001
Pages411–417
PublisherSpringer Verlag
> Publications > The Bayesian Committee Support Vector Machine