Sciweavers

989 search results - page 18 / 198
» Classification and regression trees
Sort
View
JCP
2006
74views more  JCP 2006»
14 years 9 months ago
Local Boosting of Decision Stumps for Regression and Classification Problems
Numerous data mining problems involve an investigation of associations between features in heterogeneous datasets, where different prediction models can be more suitable for differ...
Sotiris B. Kotsiantis, Dimitris Kanellopoulos, Pan...
WWW
2011
ACM
14 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
ICML
2010
IEEE
14 years 10 months ago
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
Seyoung Kim, Eric P. Xing
JMLR
2010
102views more  JMLR 2010»
14 years 4 months ago
Unsupervised Supervised Learning I: Estimating Classification and Regression Errors without Labels
Estimating the error rates of classifiers or regression models is a fundamental task in machine learning which has thus far been studied exclusively using supervised learning tech...
Pinar Donmez, Guy Lebanon, Krishnakumar Balasubram...
EPIA
2005
Springer
15 years 3 months ago
Adapting Peepholing to Regression Trees
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
Luís Torgo, Joana Marques