论文信息 - The Bayesian Committee Support Vector Machine

The Bayesian Committee Support Vector Machine

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 points. We verify the good performance of the BC-SVM using several data sets.

Anton Schwaighofer | Volker Tresp | Volker Tresp | Anton Schwaighofer

[1] Volker Tresp,et al. The generalized Bayesian committee machine , 2000, KDD '00.

[3] Thorsten Joachims,et al. Making large-scale support vector machine learning practical , 1999 .

[4] Peter Sollich,et al. Probabilistic Methods for Support Vector Machines , 1999, NIPS.

[5] Michael E. Tipping. The Relevance Vector Machine , 1999, NIPS.

[6] Volker Tresp,et al. A Bayesian Committee Machine , 2000, Neural Computation.

[7] Raghu Ramakrishnan,et al. Proceedings : KDD 2000 : the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2000, Boston, MA, USA , 2000 .