64 search results - page 5 / 13 » On the Boosting Ability of Top-Down Decision Tree Learning A... |
AIPS
2008
13 years 10 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
HIPC
2005
Springer
14 years 1 months ago
2005
Springer
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
ICML
1996
IEEE
13 years 11 months ago
1996
IEEE
A learner's performance does not rely only on the representation language and on the algorithm inducing a hypothesis in this language. Also the way the induced hypothesis is ...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...