An iterative linear programming solution to the Euclidean regression model
Computers and Operations Research
Better subset regression using the nonnegative garrote
Technometrics
Moderate projection pursuit regression for multivariate response data
Computational Statistics & Data Analysis
Hi-index | 0.00 |
A new mathematical programming model is proposed to address the subset selection problem in multiple linear regression where the objective is to select a minimal subset of predictor variables without sacrificing any explanatory power. A parametric solution of this model yields a number of efficient subsets. To obtain this solution, an optimal or one of two heuristic algorithms is repeatedly used. The subsets generated are compared to ones generated by several standard procedures. The results suggest that the new approach finds subsets that compare favorably against the standard procedures in terms of the generally accepted measure: adjusted R^2.