Sparse kernel fisher discriminant analysis

Authors:
Hongjie Xing;Yujiu Yang;Yong Wang;Baogang Hu
Affiliations:
National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China;National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China;National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China;National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, China
Venue:
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Year:
2005

Citing 3
Cited 1

Regularization theory and neural networks architectures

Neural Computation
Sparse bayesian learning and the relevance vector machine

The Journal of Machine Learning Research
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)

Constructing sparse KFDA using pre-image reconstruction

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method of Sparse Kernel Fisher Discriminant Analysis (SKFDA) through approximating the implicit within-class scatter matrix in feature space. Traditional Kernel Fisher Discriminant Analysis (KFDA) has to use all the training samples to construct the implicit within-class scatter matrix while SKFDA needs only small part of them. Based on this idea, the aim of sparseness can be obtained. Experiments show that SKFDA can dramatically reduce the number of training samples used for constructing the implicit within-class scatter matrix. Numerical simulations on “Banana Shaped” and “Ripley and Ionosphere” data sets confirm that SKFDA has the merit of decreasing the training complexity of KFDA.