Extending Kernel Fisher Discriminant Analysis with the Weighted Pairwise Chernoff Criterion

Abstract

Many linear discriminant analysis (LDA) and kernel Fisher discriminant analysis (KFD) methods are based on the restrictive assumption that the data are homoscedastic. In this paper, we propose a new KFD method called heteroscedastic kernel weighted discriminant analysis (HKWDA) which has several appealing characteristics. First, like all kernel methods, it can handle nonlinearity efficiently in a disciplined manner. Second, by incorporating a weighting function that can capture heteroscedastic data distributions into the discriminant criterion, it can work under more realistic situations and hence can further enhance the classification accuracy in many real-world applications. Moreover, it can effectively deal with the small sample size problem. We have performed some face recognition experiments to compare HKWDA with several linear and nonlinear dimensionality reduction methods, showing that HKWDA consistently gives the best results.

Cite

Text

Dai et al. "Extending Kernel Fisher Discriminant Analysis with the Weighted Pairwise Chernoff Criterion." European Conference on Computer Vision, 2006. doi:10.1007/11744085_24

Markdown

[Dai et al. "Extending Kernel Fisher Discriminant Analysis with the Weighted Pairwise Chernoff Criterion." European Conference on Computer Vision, 2006.](https://mlanthology.org/eccv/2006/dai2006eccv-extending/) doi:10.1007/11744085_24

BibTeX

@inproceedings{dai2006eccv-extending,
  title     = {{Extending Kernel Fisher Discriminant Analysis with the Weighted Pairwise Chernoff Criterion}},
  author    = {Dai, Guang and Yeung, Dit-Yan and Chang, Hong},
  booktitle = {European Conference on Computer Vision},
  year      = {2006},
  pages     = {308-320},
  doi       = {10.1007/11744085_24},
  url       = {https://mlanthology.org/eccv/2006/dai2006eccv-extending/}
}