94 search results - page 9 / 19 » Boosting Lazy Decision Trees |
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...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
PAA
2002
13 years 7 months ago
2002
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
ICMLA
2010
13 years 5 months ago
2010
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...