Data representation via refined discriminant analysis and common class structure

被引:1
作者
Dornaika, F. [1 ,2 ,3 ]
Khoder, A. [2 ]
Khoder, W. [4 ]
机构
[1] Henan Univ, Sch Comp & Informat Engn, Kaifeng, Peoples R China
[2] Univ Basque Country, UPV EHU, San Sebastian, Spain
[3] Basque Fdn Sci, IKERBASQUE, Bilbao, Spain
[4] Univ Toulon & Var, Lab Informat & Syst LIS, La Garde, France
关键词
Discriminant embedding; Class-sparsity; Gradient descent; Feature extraction; Hybrid transformation; Classification; FEATURE-SELECTION;
D O I
10.1016/j.neucom.2021.12.068
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The main goal of discriminant embedding is to extract features that form a compact and informative representation of the original feature set. In this paper, we propose an improved hybrid method aimed at extracting linear features for supervised multiclass classification. We implement a unifying criterion that is able to preserve the benefits of robust sparse linear discrimination along with inter-class sparsity. The expected transformation involves two forms of discrimination, namely: common class or group sparsity in addition to robust discriminant analysis with feature ranking. For the purpose of solving the proposed criterion, an iterative alternating minimization framework is used to evaluate the linear transformation and orthogonal matrix. The presented scheme is generic enough that it can be used to consolidate and tune several linear embedding methods. In the light of experiments conducted on various image datasets with different types, the suggested scheme was able to outperform other methods in most cases. (C) 2021 Published by Elsevier B.V.
引用
收藏
页码:348 / 360
页数:13
相关论文
共 66 条
[1]  
[Anonymous], 2015, IEEE T NEURAL NETWOR
[2]   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
[3]   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
[4]  
Cai X, 2013, 19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), P1124
[5]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[6]  
Chen HT, 2005, PROC CVPR IEEE, P846
[7]  
Chen W., 2020, MATLAB Central File Exchange
[8]   Sparse Discriminant Analysis [J].
Clemmensen, Line ;
Hastie, Trevor ;
Witten, Daniela ;
Ersboll, Bjarne .
TECHNOMETRICS, 2011, 53 (04) :406-413
[9]   Learning robust latent representation for discriminative regression [J].
Cui, Jinrong ;
Zhu, Qi ;
Wang, Ding ;
Li, Zuoyong .
PATTERN RECOGNITION LETTERS, 2019, 117 :193-200
[10]   Discriminant non-negative graph embedding for face recognition [J].
Cui, Jinrong ;
Wen, Jiajun ;
Li, Zhengming ;
Li, Bin .
NEUROCOMPUTING, 2015, 149 :1451-1460