Sciweavers

4255 search results - page 525 / 851
» On Learning Boolean Functions
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...
ICML
2010
IEEE
15 years 7 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
CORR
2006
Springer
111views Education» more  CORR 2006»
15 years 6 months ago
An associative memory for the on-line recognition and prediction of temporal sequences
This paper presents the design of an associative memory with feedback that is capable of on-line temporal sequence learning. A framework for on-line sequence learning has been prop...
Joy Bose, Stephen B. Furber, Jonathan L. Shapiro
ML
2002
ACM
145views Machine Learning» more  ML 2002»
15 years 6 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
NN
2007
Springer
105views Neural Networks» more  NN 2007»
15 years 6 months ago
Guiding exploration by pre-existing knowledge without modifying reward
Reinforcement learning is based on exploration of the environment and receiving reward that indicates which actions taken by the agent are good and which ones are bad. In many app...
Kary Främling