Sciweavers

41 search results - page 4 / 9
» Support Vector Machinery for Infinite Ensemble Learning
Sort
View
IJCAI
2007
13 years 9 months ago
Ensembles of Partially Trained SVMs with Multiplicative Updates
The training of support vector machines (SVM) involves a quadratic programming problem, which is often optimized by a complicated numerical solver. In this paper, we propose a muc...
Ivor W. Tsang, James T. Kwok
JMLR
2002
137views more  JMLR 2002»
13 years 7 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
ECML
2004
Springer
14 years 1 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
ICML
2008
IEEE
14 years 8 months ago
Composite kernel learning
The Support Vector Machine (SVM) is an acknowledged powerful tool for building classifiers, but it lacks flexibility, in the sense that the kernel is chosen prior to learning. Mul...
Marie Szafranski, Yves Grandvalet, Alain Rakotomam...
WWW
2005
ACM
14 years 8 months ago
Boosting SVM classifiers by ensemble
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
Yan-Shi Dong, Ke-Song Han