DocumentCode
401723
Title
Sparse model selection and parameter identification
Author
Duan, Xiao-Jun ; Wang, Zheng-Ming
Author_Institution
Inst. of Syst. Eng., Nat. Univ. of Defense Technol., Changsha, China
Volume
3
fYear
2003
fDate
2-5 Nov. 2003
Firstpage
1746
Abstract
Model selection generally considers the tradeoff between the model fidelity and its complexity, which is realized by structural risk minimization. By the regularization-based sparse component analysis method, a novel regularization function is constructed, then a new principle of model selection is presented with corresponding algorithm of coefficient solution. Finally, a noisy polynomial signal with missing term is presented, which is processed to get the coefficients by our method and the least square method respectively. Numeric results demonstrate that our method can identify the missing term and solve the coefficient accurately at the same time. However, the least square method must be used combining with different model order selection criteria and the estimated coefficients are not accurate.
Keywords
least squares approximations; minimisation; parameter estimation; signal processing; sparse matrices; least square method; model fidelity; noisy polynomial signal; parameter identification; regularization function; sparse component analysis; sparse model selection; structural risk minimization; Algorithm design and analysis; Data processing; Electronic mail; Least squares methods; Matching pursuit algorithms; Parameter estimation; Polynomials; Risk management; Signal processing; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2003 International Conference on
Print_ISBN
0-7803-8131-9
Type
conf
DOI
10.1109/ICMLC.2003.1259779
Filename
1259779
Link To Document