888 search results - page 62 / 178 » Learning to Select a Ranking Function |
ITICSE
1997
ACM
14 years 5 days ago
1997
ACM
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
JMLR
2010
13 years 2 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
We treat feature selection and basis selection in a unified framework by introducing the masking matrix. If one considers feature selection as finding a binary mask vector that de...
INTERSPEECH
2010
13 years 2 months ago
2010
Our goal is to automatically learn a perceptually-optimal target cost function for a unit selection speech synthesiser. The approach we take here is to train a classifier on human...