Learn Before
Concept

Backward Stepwise Selection Algorithm

  1. Let MpM_p denote the null model, which contains no predictors.
  2. For k = p, p-1, ..., 1: (a) Consider all k models that contain all but one of the predictors in MkM_k for a total of k - 1 predictors. (b) Choose the best among these k models, and call it Mk1M_{k-1}. Here best is defined as having smallest RSS or highest R2R^2.
  3. Select a single best model from among M0,...,MpM_0, ..., M_p using cross-validated prediction error, CpC_p (AIC), BIC, or adjusted R2R^2.

Restriction: requires that the number of samples n is larger than the number of variables p so that the full model can be fit.

0

0

Updated 2020-06-22

Tags

Data Science