Neighborhood search heuristics for selecting hierarchically well-formulated subsets in polynomial regression

DOI10.1002/nav.20380zbMath1183.62110OpenAlexW1969911004MaRDI QIDQ3406120

Douglas Steinley, Michael J. Brusco

Publication date: 12 February 2010

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20380

zbMATH Keywords

tabu searchpolynomial regressionvariable neighborhood searchsubset regression

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) General nonlinear regression (62J02) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Exact methods for variable selection in principal component analysis: guide functions and pre-selection ⋮ Integrating linear discriminant analysis, polynomial basis expansion, and genetic search for two-group classification ⋮ Exact and approximate algorithms for variable selection in linear discriminant analysis

Uses Software

• Matlab
• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Least angle regression. (With discussion)
• Better Subset Regression Using the Nonnegative Garrote
• Penalty calculations and branching rules in a LAV best subset procedure
• Flexible Parsimonious Smoothing and Additive Modeling
• Regressions by Leaps and Bounds
• Tabu search model selection in multiple regression analysis
• Exploring Partial Residual Plots
• A Bayesian Variable-Selection Approach for Analyzing Designed Experiments with Complex Aliasing
• Design of follow-up experiments for improving model discrimination and parameter estimation
• Functional marginality and response-surface fitting
• Computational Efficiency in the Selection of Regression Variables