Linear discriminant analysis with worst between-class separation and average within-class compactness

doi:10.1007/s11704-014-3337-x

Frontiers of Computer Science

2014, Vol. 8

Issue (5): 785-792 https://doi.org/10.1007/s11704-014-3337-x

本期目录

Linear discriminant analysis with worst between-class separation and average within-class compactness

Leilei YANG, Songcan CHEN(

)

College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China

全文: PDF(413 KB)

Abstract：

Linear discriminant analysis (LDA) is one of the most popular supervised dimensionality reduction (DR) techniques and obtains discriminant projections by maximizing the ratio of average-case between-class scatter to averagecase within-class scatter. Two recent discriminant analysis algorithms (DAS), minimal distance maximization (MDM) and worst-case LDA (WLDA), get projections by optimizing worst-case scatters. In this paper, we develop a new LDA framework called LDA with worst between-class separation and average within-class compactness (WSAC) by maximizing the ratio of worst-case between-class scatter to averagecase within-class scatter. This can be achieved by relaxing the trace ratio optimization to a distance metric learning problem. Comparative experiments demonstrate its effectiveness. In addition, DA counterparts using the local geometry of data and the kernel trick can likewise be embedded into our framework and be solved in the same way.

Key words： dimensionality reduction linear discriminant analysis the worst separation the average compactness

收稿日期: 2013-09-07 出版日期: 2014-10-11

Corresponding Author(s): Songcan CHEN

引用本文:

. [J]. Frontiers of Computer Science, 2014, 8(5): 785-792.
Leilei YANG, Songcan CHEN. Linear discriminant analysis with worst between-class separation and average within-class compactness. Front. Comput. Sci., 2014, 8(5): 785-792.

链接本文:

https://academic.hep.com.cn/fcs/CN/10.1007/s11704-014-3337-x
https://academic.hep.com.cn/fcs/CN/Y2014/V8/I5/785

1	K Fukunaga. Statistical Pattern Recognition. Academic Press, 1990
2	R Duda. P Hart. D Stork. Pattern Classification. 2nd ed. New York: John Wiley & Sons, Inc., 2001
3	B Yang. S Chen. X Wu. A structurally motivated framework for discriminant analysis. Pattern Analysis and Application, 2011, 14(4): 349−367 https://doi.org/10.1007/s10044-011-0228-8
4	H Jae. K Nojun. Generalization of linear discriminant analysis using L p-norm. Pattern Recognition Letters, 2013, 34(6): 679−685 https://doi.org/10.1016/j.patrec.2013.01.016
5	W Ching. D Chu. L Liao. X Wang. Regularized orthogonal linear discriminant analysis. Pattern Recognition, 2012, 45(7): 2719−2732 https://doi.org/10.1016/j.patcog.2012.01.007
6	H Li. T Jiang. K Zhang. Efficient and robust feature extraction by maximum margin criterion. IEEE Transaction on Neural Networks, 2006, 17(1): 157−165 https://doi.org/10.1109/TNN.2005.860852
7	Z Nenadic. Information discriminant analysis: feature extraction with an information-theoretic objective. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007, 29(8): 1394−1407 https://doi.org/10.1109/TPAMI.2007.1156
8	M Zhu. A Martinez. Subclass discriminant analysis. IEEE Transactions on Pattern Analysis andMachine Intelligence, 2006, 28(8): 1274−1286
9	Q Gao. J Liu. H Zhang. J Hou. X Yang. Enhanced fisher discriminant criterion for image recognition. Pattern Recognition, 2012, 45(10): 3717−3724 https://doi.org/10.1016/j.patcog.2012.03.024
10	D Cai. X He. Z Kun. J Han. H Bao. Local sensitive discriminant analysis. In Proceedings of the international joint conference on artificial intelligence. 2007, 141−146
11	Z Fan. Y Xu. D Zhang. Local linear discriminant analysis framework using sample neighbors. IEEE Transaction on Neural Networks, 2011, 22(7): 1119−1132 https://doi.org/10.1109/TNN.2011.2152852
12	B Xu. K Huang. C Liu. Dimensionality reduction by minimal distance maximization. In: Proceedings of 20th International Conference on Pattern Recognition, 2010, 569−572
13	Y Zhang. D Yeung. Worst-case linear discriminant analysis. In: Proceedings of Advances in Neural Information Processing Systems. 2010, 2568−2576
14	Y Ying. P Li. Distance metric learning with eigenvalue optimization. Journal of Machine Learning Research, 2012, 13: 1−26
15	M Overton. R Womersley. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math Programming, 1993, 62(2): 321−357 https://doi.org/10.1007/BF01585173
16	M Overton. On minimizing the maximum eigenvalue of a symmetric matrix. SIAM Journal on Matrix Analysis and Applications, 1988, 9(2): 256−268 https://doi.org/10.1137/0609021
17	Y Zhang. D Yeung. Semi-supervised generalized discriminant analysis. IEEE Transactions on Neural Network, 2011, 22(8): 1207−1217 https://doi.org/10.1109/TNN.2011.2156808
18	S Mika. G Ratsch. J Weston. B Scholkopf. A Smola. K Muller. Constructing descriptive and discriminative nonlinear features: Rayleigh coefficients in kernel feature spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(5): 623−628 https://doi.org/10.1109/TPAMI.2003.1195996
19	R Duin. M Loog. Linear dimensionality reduction via a heteroscedastic extension of LDA: the Chernoff criterion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(6): 732−739 https://doi.org/10.1109/TPAMI.2004.13
20	A Frank. A Asuncion. UCI Machine Learning Repository.
21	P Belhumeur. J Hespanha. D Kriegman. Eigenfaces vs fisherfaces: recognition using class specific linear projection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997, 19(7): 711−720 https://doi.org/10.1109/34.598228
22	A Martinez. R Benavente. The AR-face database. Technical Report 24, CVC, 1998.
23	S Nene. S Nayar. H Murase. Columbia Object Image Library (COIL-20). Technical Report005, CUCS, 1996.

Viewed

Full text

Abstract

Cited

Shared

Discussed