Sciweavers

406 search results - page 4 / 82
» Covering Numbers for Support Vector Machines
Sort
View
IJCNN
2008
IEEE
14 years 4 months ago
Sparse support vector machines trained in the reduced empirical feature space
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...
Kazuki Iwamura, Shigeo Abe
ICPR
2006
IEEE
14 years 11 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt
ICANN
2001
Springer
14 years 2 months ago
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...
Anton Schwaighofer, Volker Tresp
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 9 months ago
Choosing Multiple Parameters for Support Vector Machines
The problem of automatically tuning multiple parameters for pattern recognition Support Vector Machines (SVMs) is considered. This is done by minimizing some estimates of the gener...
Olivier Chapelle, Vladimir Vapnik, Olivier Bousque...
ICONIP
2007
13 years 11 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor