3694 search results - page 239 / 739 » Stochastic complexity in learning |
198
click to vote
NIPS
2004
15 years 7 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
180
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
143
click to vote
NAACL
2010
15 years 3 months ago
2010
We show how features can easily be added to standard generative models for unsupervised learning, without requiring complex new training methods. In particular, each component mul...
156
click to vote
ICMCS
2009
IEEE
15 years 3 months ago
2009
IEEE
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...