Sciweavers

377 search results - page 21 / 76
» Learning Linear Ordering Problems for Better Translation
Sort
View
JMLR
2008
209views more  JMLR 2008»
14 years 9 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
PR
2008
144views more  PR 2008»
14 years 9 months ago
Kernel quadratic discriminant analysis for small sample size problem
It is generally believed that quadratic discriminant analysis (QDA) can better fit the data in practical pattern recognition applications compared to linear discriminant analysis ...
Jie Wang, Konstantinos N. Plataniotis, Juwei Lu, A...
VLSISP
2010
254views more  VLSISP 2010»
14 years 8 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
ICML
2006
IEEE
15 years 3 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
SIGIR
2006
ACM
15 years 3 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi