We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Abstract. This paper presents a neural network tree regression system with dynamic optimization of input variable transformations and post-training optimization. The decision tree ...
Miroslaw Kordos, Marcin Blachnik, Tadeusz Wieczore...
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
- This paper investigates a technique for predicting ensemble uncertainty originally proposed in the weather forecasting domain. The overall purpose is to find out if the technique...
A new boosting algorithm ADABOOST-R for regression problems is presented and upper bound on the error is obtained. Experimental results to compare ADABOOST-R and other learning alg...
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...