Efficient and robust feature extraction by maximum margin criterion

被引:50
作者
Liu, Jun [1 ]
Cheri, Songcan [1 ]
Tan, Xiaoyang [1 ]
Zhang, Daoqiang [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Dept Comp Sci & Engn, Nanjing 210016, Peoples R China
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 2007年 / 18卷 / 06期
关键词
4;
D O I
10.1109/TNN.2007.900813
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The goal of this comment is to first point out two loopholes in the paper by Li et aL (2006): 1) so-designed efficient maximal margin criterion (MMC) algorithm for small sample size (SSS) problem is problematic and 2) the discussion on the equivalence with the null-space-based methods in SSS problem does not hold. Then, we will present a really efficient MMC algorithm for SSS problem.
引用
收藏
页码:1862 / 1864
页数:3
相关论文
共 4 条
[1]  
[Anonymous], MATRIX COMPUTAIONS
[2]  
Huang R, 2002, INT C PATT RECOG, P29, DOI 10.1109/ICPR.2002.1047787
[3]   Efficient and robust feature extraction by maximum margin criterion [J].
Li, HF ;
Jiang, T ;
Zhang, KS .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2006, 17 (01) :157-165
[4]  
Li HF, 2005, 2005 IEEE COMPUTATIONAL SYSTEMS BIOINFORMATICS CONFERENCE, PROCEEDINGS, P310