49 search results - page 2 / 10 » A decision-theoretic generalization of on-line learning and ... |
IJCAI
2007
13 years 6 months ago
2007
There is a growing interest in intelligent assistants for a variety of applications from organizing tasks for knowledge workers to helping people with dementia. In this paper, we ...
EUROCOLT
1995
Springer
13 years 9 months ago
1995
Springer
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
NIPS
2007
13 years 6 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
KDD
2010
ACM
13 years 9 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...
ML
2002
ACM
13 years 5 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...