Sciweavers

888 search results - page 97 / 178
» Learning to Select a Ranking Function
Sort
View
NIPS
2008
13 years 9 months ago
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
Francis Bach
ECML
2006
Springer
13 years 11 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
BMCBI
2006
127views more  BMCBI 2006»
13 years 8 months ago
A graph-search framework for associating gene identifiers with documents
Background: One step in the model organism database curation process is to find, for each article, the identifier of every gene discussed in the article. We consider a relaxation ...
William W. Cohen, Einat Minkov
JDCTA
2010
148views more  JDCTA 2010»
13 years 2 months ago
Web Services Supervision System Based on Jade
Web service technology is one of the trend technologies in computer science now, and recently with the rapid growth of web services deployed with the same functionality, many rese...
Ahmed Sallam, Zhiyong Li, Shaimaa Hassan
ECAI
2008
Springer
13 years 9 months ago
Reinforcement Learning with the Use of Costly Features
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
Robby Goetschalckx, Scott Sanner, Kurt Driessens