1707 search results - page 83 / 342 » A Boosting Algorithm for Regression |
119
click to vote
ISCI
2008
15 years 4 months ago
2008
This paper studies the greedy ensemble selection family of algorithms for ensembles of regression models. These algorithms search for the globally best subset of regresmaking loca...
129
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
125
click to vote
ISMIS
2000
Springer
15 years 8 months ago
2000
Springer
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
133
click to vote
IJCAI
2003
15 years 5 months ago
2003
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
109
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or