A Sparse Classification Based on a Linear Regression Method for Spectral Recognition

被引:4
作者
Ye, Pengchao [1 ]
Ji, Guoli [1 ,2 ]
Yuan, Lei-Ming [3 ]
Li, Limin [3 ]
Chen, Xiaojing [3 ]
Karimidehcheshmeh, Fatemeh [1 ]
Chen, Xi [3 ]
Huang, Guangzao [3 ]
机构
[1] Xiamen Univ, Dept Automat, Xiamen 361005, Fujian, Peoples R China
[2] Natl Ctr Healthcare Big Data, Xiamen Res Inst, Xiamen 361005, Fujian, Peoples R China
[3] Wenzhou Univ, Coll Math Phys & Elect Informat Engn, Wenzhou 325035, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2019年 / 9卷 / 10期
基金
中国国家自然科学基金;
关键词
spectral analysis; linear regression; regression residuals; sparse classification; INDUCED BREAKDOWN SPECTROSCOPY; NIR SPECTROSCOPY; SELECTION;
D O I
10.3390/app9102053
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
This study introduces a spectral-recognition method based on sparse representation. The proposed method, the linear regression sparse classification (LRSC) algorithm, uses different classes of training samples to linearly represent the prediction samples and to further classify them according to residuals in a linear regression model. Two kinds of spectral data with completely different physical properties were used in this study. These included infrared spectral data and laser-induced breakdown spectral (LIBS) data for Tegillarca granosa samples polluted by heavy metals. LRSC algorithm was employed to recognize the two classes of data, and the results were compared with common spectral-recognition algorithms, such as partial least squares discriminant analysis (PLS-DA), soft independent modeling of class analogy (SIMCA), artificial neural network (ANN), random forest (RF), and support vector machine (SVM), in terms of recognition rate and parameter stability. The results show that LRSC algorithm is not only simple and convenient, but it also has a high recognition rate.
引用
收藏
页数:14
相关论文
共 27 条
[1]   On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems [J].
Amaldi, E ;
Kann, V .
THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) :237-260
[2]  
ASIF M., 2008, PRIMAL DUAL PURSUIT
[3]   Classification tools in chemistry. Part 1: linear models. PLS-DA [J].
Ballabio, Davide ;
Consonni, Viviana .
ANALYTICAL METHODS, 2013, 5 (16) :3790-3798
[4]   Deviance residuals-based sparse PLS and sparse kernel PLS regression for censored data [J].
Bastien, Philippe ;
Bertrand, Frederic ;
Meyer, Nicolas ;
Maumy-Bertrand, Myriam .
BIOINFORMATICS, 2015, 31 (03) :397-404
[5]   Principal component analysis [J].
Bro, Rasmus ;
Smilde, Age K. .
ANALYTICAL METHODS, 2014, 6 (09) :2812-2831
[6]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[7]  
Chen XJ, 2015, ANAL METHODS-UK, V7, P2172, DOI [10.1039/C4AY02396J, 10.1039/c4ay02396j]
[8]  
CORTES C, 1995, MACH LEARN, V20, P273, DOI 10.1023/A:1022627411411
[9]   For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J].
Donoho, DL .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) :797-829
[10]   Comparison of baseline removal methods for laser-induced breakdown spectroscopy of geological samples [J].
Dyar, M. Darby ;
Giguere, Stephen ;
Carey, C. J. ;
Boucher, Thomas .
SPECTROCHIMICA ACTA PART B-ATOMIC SPECTROSCOPY, 2016, 126 :53-64