Sciweavers

9 search results - page 1 / 2
» Direct convex relaxations of sparse SVM
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Direct convex relaxations of sparse SVM
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
ICML
2010
IEEE
13 years 10 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 5 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
SIAMJO
2011
13 years 4 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
CVPR
2010
IEEE
13 years 9 months ago
Multi-view structure computation without explicitly estimating motion
Most existing structure-from-motion methods follow a common two-step scheme, where relative camera motions are estimated in the first step and 3D structure is computed afterward ...
Hongdong Li