Feature Extraction via Generalized Uncorrelated Linear Discriminant Analysis
Abstract
Feature extraction is important in many applications, such as text and imageretrieval, because of high dimensionality. Uncorrelated Linear Discriminant Analysis(ULDA) was recently proposed for feature extraction. The extracted features via ULDA were shown to be statistically uncorrelated, which is desirable for manyapplications. In this paper, we will first propose the ULDA/QR algorithm to simplify theprevious implementation of ULDA. Then we propose the ULDA/GSVD algorithm, based on a novel optimization criterion, to address the singularity problem. It isapplicable for undersampled problem, where the data dimension is much larger than the datasize, such as text and image retrieval. The novel criterion used in ULDA/GSVD is the perturbed version of the one from ULDA/QR, while surprisingly, the solution to ULDA/GSVD is shown to be independent of the amount of perturbation applied. We did extensive experiments on text and face image data to show theeffectiveness of ULDA/GSVD and compare with other popular feature extraction algorithms.
Cite
Text
Ye et al. "Feature Extraction via Generalized Uncorrelated Linear Discriminant Analysis." International Conference on Machine Learning, 2004. doi:10.1145/1015330.1015348Markdown
[Ye et al. "Feature Extraction via Generalized Uncorrelated Linear Discriminant Analysis." International Conference on Machine Learning, 2004.](https://mlanthology.org/icml/2004/ye2004icml-feature/) doi:10.1145/1015330.1015348BibTeX
@inproceedings{ye2004icml-feature,
title = {{Feature Extraction via Generalized Uncorrelated Linear Discriminant Analysis}},
author = {Ye, Jieping and Janardan, Ravi and Li, Qi and Park, Haesun},
booktitle = {International Conference on Machine Learning},
year = {2004},
doi = {10.1145/1015330.1015348},
url = {https://mlanthology.org/icml/2004/ye2004icml-feature/}
}