Sciweavers

308 search results - page 22 / 62
» Efficient reduction of support vectors in kernel-based metho...
Sort
View
JMLR
2006
93views more  JMLR 2006»
13 years 7 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
ICML
2008
IEEE
14 years 8 months ago
Sparse multiscale gaussian process regression
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
Bernhard Schölkopf, Christian Walder, Kwang I...
ESANN
2008
13 years 9 months ago
Survival SVM: a practical scalable algorithm
This work advances the Support Vector Machine (SVM) based approach for predictive modelling of failure time data as proposed in [1]. The main results concern a drastic reduction in...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
BMCBI
2010
243views more  BMCBI 2010»
13 years 8 months ago
Comparative study of unsupervised dimension reduction techniques for the visualization of microarray gene expression data
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
CVPR
2008
IEEE
14 years 9 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...