Robust Sparse Linear Discriminant Analysis

被引:308
作者
Wen, Jie [1 ,2 ]
Fang, Xiaozhao [3 ]
Cui, Jinrong [4 ]
Fei, Lunke [3 ]
Yan, Ke [1 ,2 ]
Chen, Yan [5 ]
Xu, Yong [1 ,2 ]
机构
[1] Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen 518055, Peoples R China
[2] Harbin Inst Technol, Shenzhen Med Biometr Percept & Anal Engn Lab, Shenzhen 518055, Peoples R China
[3] Guangdong Univ Technol, Sch Comp Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China
[4] South China Agr Univ, Coll Math & Informat, Guangzhou 510000, Guangdong, Peoples R China
[5] Shenzhen Sunwin Intelligent Corp, Shenzhen 518000, Peoples R China
基金
中国国家自然科学基金;
关键词
Linear discriminant analysis; feature selection; feature extraction; data reconstruction; FEATURE-SELECTION; CLASSIFICATION; RECOGNITION; REDUCTION; FRAMEWORK; GRAPH;
D O I
10.1109/TCSVT.2018.2799214
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Linear discriminant analysis (LDA) is a very popular supervised feature extraction method and has been extended to different variants. However, classical LDA has the following problems: 1) The obtained discriminant projection does not have good interpretability for features; 2) LDA is sensitive to noise; and 3) LDA is sensitive to the selection of number of projection directions. In this paper, a novel feature extraction method called robust sparse linear discriminant analysis (RSLDA) is proposed to solve the above problems. Specifically, RSLDA adaptively selects the most discriminative features for discriminant analysis by introducing the l(2,1) norm. An orthogonal matrix and a sparse matrix are also simultaneously introduced to guarantee that the extracted features can hold the main energy of the original data and enhance the robustness to noise, and thus RSLDA has the potential to perform better than other discriminant methods. Extensive experiments on six databases demonstrate that the proposed method achieves the competitive performance compared with other state-of-the-art feature extraction methods. Moreover, the proposed method is robust to the noisy data.
引用
收藏
页码:390 / 403
页数:14
相关论文
共 55 条
[1]  
[Anonymous], 2016, PROC CVPR IEEE, DOI DOI 10.1109/CVPR.2016.322
[2]   Effective dimension reduction methods for tumor classification using gene expression data [J].
Antoniadis, A ;
Lambert-Lacroix, S ;
Leblanc, F .
BIOINFORMATICS, 2003, 19 (05) :563-570
[3]   Evaluating Open-Universe Face Identification on the Web [J].
Becker, Brian C. ;
Ortiz, Enrique G. .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION WORKSHOPS (CVPRW), 2013, :904-911
[4]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[5]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[6]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[7]   Sparse Discriminant Analysis [J].
Clemmensen, Line ;
Hastie, Trevor ;
Witten, Daniela ;
Ersboll, Bjarne .
TECHNOMETRICS, 2011, 53 (04) :406-413
[8]  
Donahue J, 2014, PR MACH LEARN RES, V32
[9]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[10]  
Dorfer M., 2015, ARXIV151104707