Sparse modelling using orthogonal forward regression with PRESS statistic and regularization
The paper introduces an efficient construction algorithm for obtaining sparse linear-in-the-weights regression models based on an approach of directly optimizing model generalization capability. This is achieved by utilizing the delete-1 cross validation concept and the associated leave-one-out test...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
2004-04.
|
Subjects: | |
Online Access: | Get fulltext Get fulltext |
LEADER | 01720 am a22001693u 4500 | ||
---|---|---|---|
001 | 259231 | ||
042 | |a dc | ||
100 | 1 | 0 | |a Chen, S. |e author |
700 | 1 | 0 | |a Hong, X. |e author |
700 | 1 | 0 | |a Harris, C.J. |e author |
700 | 1 | 0 | |a Sharkey, P.M. |e author |
245 | 0 | 0 | |a Sparse modelling using orthogonal forward regression with PRESS statistic and regularization |
260 | |c 2004-04. | ||
856 | |z Get fulltext |u https://eprints.soton.ac.uk/259231/1/ofrPRESS.ps | ||
856 | |z Get fulltext |u https://eprints.soton.ac.uk/259231/2/01275524.pdf | ||
520 | |a The paper introduces an efficient construction algorithm for obtaining sparse linear-in-the-weights regression models based on an approach of directly optimizing model generalization capability. This is achieved by utilizing the delete-1 cross validation concept and the associated leave-one-out test error also known as the PRESS (Predicted REsidual Sums of Squares) statistic, without resorting to any other validation data set for model evaluation in the model construction process. Computational efficiency is ensured using an orthogonal forward regression, but the algorithm incrementally minimizes the PRESS statistic, instead of the usual sum of the squared training errors. A local regularization method can naturally be incorporated into the model selection procedure to further enforce model sparsity. The proposed algorithm is fully automatic and the user is not required to specify any criterion to terminate the model construction procedure. Comparisons with some of the existing state-of-art modeling methods are given, and several examples are included to demonstrate the ability of the proposed algorithm to effectively construct sparse models that generalize well. | ||
655 | 7 | |a Article |