1055 search results - page 27 / 211 » Convex Factorization Machines |
NIPS
2001
14 years 11 months ago
2001
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very ...
107
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
FMSD
2006
14 years 10 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
76
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we present a scheme towards recognition of English character in multi-scale and multi-oriented environments. Graphical document such as map consists of text lines w...
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...