Sciweavers

12 search results - page 2 / 3
» A Direct Formulation for Sparse PCA Using Semidefinite Progr...
Sort
View
ESANN
2004
13 years 6 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
ICML
2005
IEEE
14 years 5 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
NIPS
2003
13 years 6 months ago
Image Reconstruction by Linear Programming
— One way of image denoising is to project a noisy image to the subspace of admissible images derived, for instance by PCA. However, a major drawback of this method is that all p...
Koji Tsuda, Gunnar Rätsch
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 5 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 4 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...