Robust linear model selection based on least angle regression

Subscribe to email list

Please select the email list(s) to which you wish to subscribe.
CAPTCHA
This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.
Image CAPTCHA

Enter the characters shown in the image.

User menu

You are here

Robust linear model selection based on least angle regression

TitleRobust linear model selection based on least angle regression
Publication TypeJournal Article
Year of Publication2007
AuthorsKhan, JA, Van Aelst, S, Zamar, RH
JournalJOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
Volume102
Pagination1289-1299
Date PublishedDEC
Type of ArticleArticle
ISSN0162-1459
Keywordsbootstrap, computational complexity, robust prediction, stepwise algorithm, Winsorization
AbstractIn this article we consider the problem of building a linear prediction model when the number of candidate predictors is large and the data possibly contain anomalies that are difficult to visualize and clean. We want to predict the nonoutlying cases; therefore, we need a method that is simultaneously robust and scalable. We consider the stepwise least angle regression (LARS) algorithm which is computationally very efficient but sensitive to outliers. We introduce two different approaches to robustify LARS. The plug-in approach replaces the classical correlations in LARS by robust correlation estimates. The cleaning approach first transforms the data set by shrinking the outliers toward the bulk of the data (which we call multivariate Winsorization) and then applies LARS to the transformed data. We show that the plug in approach is time-efficient and scalable and that the bootstrap can be used to stabilize its results. We recommend using bootstrapped robustified LARS to sequence a number of candidate predictors to form a reduced set from which a more refined model can be selected.
DOI10.1198/016214507000000950