DocumentCode :
809177
Title :
Fast orthogonal least squares algorithm for efficient subset model selection
Author :
Chen, S. ; Wigger, J.
Author_Institution :
Dept. of Electr. & Electron. Eng., Portsmouth Univ., UK
Volume :
43
Issue :
7
fYear :
1995
fDate :
7/1/1995 12:00:00 AM
Firstpage :
1713
Lastpage :
1715
Abstract :
An efficient implementation of the orthogonal least squares algorithm for subset model selection is derived. Computational complexity of the algorithm is examined and the result shows that this new fast orthogonal least squares algorithm significantly reduces computational requirements
Keywords :
computational complexity; least squares approximations; signal processing; computational complexity; computational requirements; efficient subset model selection; fast orthogonal least squares algorithm; Computational complexity; Least squares methods; Radial basis function networks; Signal processing algorithms;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.398734
Filename :
398734
Link To Document :
بازگشت