Sciweavers

2031 search results - page 100 / 407
» Oblique Support Vector Machines
Sort
View
ICML
2000
IEEE
14 years 9 months ago
Bounds on the Generalization Performance of Kernel Machine Ensembles
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
Luis Pérez-Breva, Massimiliano Pontil, Theo...
MICCAI
2006
Springer
14 years 9 months ago
The Entire Regularization Path for the Support Vector Domain Description
Abstract. The support vector domain description is a one-class classification method that estimates the shape and extent of the distribution of a data set. This separates the data ...
Karl Sjöstrand, Rasmus Larsen
ICML
2004
IEEE
14 years 9 months ago
Co-EM support vector learning
Multi-view algorithms, such as co-training and co-EM, utilize unlabeled data when the available attributes can be split into independent and compatible subsets. Co-EM outperforms ...
Ulf Brefeld, Tobias Scheffer
TNN
2010
143views Management» more  TNN 2010»
13 years 3 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
IJCNN
2006
IEEE
14 years 2 months ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho