10054 search results - page 483 / 2011 » On the Complexity of Function Learning |
215
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
150
Voted
ECML
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
155
Voted
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
175
click to vote
ACMICEC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we look at a supply chain of commodity goods where customer demand is uncertain and partly based on reputation, and where raw material replenishment is uncertain in...
164
Voted
ECML
2006
Springer
15 years 9 months ago
2006
Springer
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...