A wrapper method selects feature subsets by repeatedly evaluating a predictive model against a chosen metric. The learning algorithm is “wrapped” inside the search process, so the selection reflects model performance rather than feature scores alone. section 11.3.3
Common search strategies include:
- Sequential forward selection adds features one by one, starting from an empty set. section 11.3.3
- Sequential backward elimination removes features one by one; floating variants can reverse earlier inclusion or exclusion decisions. section 11.3.3
- Evolutionary algorithms sample subsets stochastically, including binary feature masks where 1 means included and 0 means excluded. section 11.3.3
A practical caution
Wrapper methods can provide an accurate estimate of how a subset affects the target metric, but they require nested validation and can be computationally intensive or converge to local optima. section 11.3.3
Figure 11.8 Families of feature selection methods
Use the feature-selection family diagram to place wrapper methods alongside alternative selection approaches. section 11.3.3
