A unified framework for generalized linear discriminant analysis

Shuiwang Ji, Jieping Ye

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope with the curse of dimensionality. In essence, most of these algorithms employ various techniques to deal with the singularity problem, which occurs when the data dimensionality is larger than the sample size. They have been applied successfully in various applications. However, there is a lack of a systematic study of the commonalities and differences of these algorithms, as well as their intrinsic relationships. In this paper, a unified framework for generalized LDA is proposed via a transfer function. The proposed framework elucidates the properties of various algorithms and their relationships. Based on the presented analysis, we propose an efficient model selection algorithm for LDA. We conduct extensive experiments using a collection of high-dimensional data, including text documents, face images, gene expression data, and gene expression pattern images, to evaluate the proposed theories and algorithms.

Original languageEnglish (US)
Title of host publication26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR
DOIs
StatePublished - 2008
Event26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR - Anchorage, AK, United States
Duration: Jun 23 2008Jun 28 2008

Other

Other26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR
CountryUnited States
CityAnchorage, AK
Period6/23/086/28/08

Fingerprint

Discriminant analysis
Gene expression
Transfer functions
Experiments

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Control and Systems Engineering

Cite this

Ji, S., & Ye, J. (2008). A unified framework for generalized linear discriminant analysis. In 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR [4587377] https://doi.org/10.1109/CVPR.2008.4587377

A unified framework for generalized linear discriminant analysis. / Ji, Shuiwang; Ye, Jieping.

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR. 2008. 4587377.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ji, S & Ye, J 2008, A unified framework for generalized linear discriminant analysis. in 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR., 4587377, 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR, Anchorage, AK, United States, 6/23/08. https://doi.org/10.1109/CVPR.2008.4587377
Ji S, Ye J. A unified framework for generalized linear discriminant analysis. In 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR. 2008. 4587377 https://doi.org/10.1109/CVPR.2008.4587377
Ji, Shuiwang ; Ye, Jieping. / A unified framework for generalized linear discriminant analysis. 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR. 2008.
@inproceedings{b959b87519964514b43d3b6e1b9d13eb,
title = "A unified framework for generalized linear discriminant analysis",
abstract = "Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope with the curse of dimensionality. In essence, most of these algorithms employ various techniques to deal with the singularity problem, which occurs when the data dimensionality is larger than the sample size. They have been applied successfully in various applications. However, there is a lack of a systematic study of the commonalities and differences of these algorithms, as well as their intrinsic relationships. In this paper, a unified framework for generalized LDA is proposed via a transfer function. The proposed framework elucidates the properties of various algorithms and their relationships. Based on the presented analysis, we propose an efficient model selection algorithm for LDA. We conduct extensive experiments using a collection of high-dimensional data, including text documents, face images, gene expression data, and gene expression pattern images, to evaluate the proposed theories and algorithms.",
author = "Shuiwang Ji and Jieping Ye",
year = "2008",
doi = "10.1109/CVPR.2008.4587377",
language = "English (US)",
isbn = "9781424422432",
booktitle = "26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR",

}

TY - GEN

T1 - A unified framework for generalized linear discriminant analysis

AU - Ji, Shuiwang

AU - Ye, Jieping

PY - 2008

Y1 - 2008

N2 - Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope with the curse of dimensionality. In essence, most of these algorithms employ various techniques to deal with the singularity problem, which occurs when the data dimensionality is larger than the sample size. They have been applied successfully in various applications. However, there is a lack of a systematic study of the commonalities and differences of these algorithms, as well as their intrinsic relationships. In this paper, a unified framework for generalized LDA is proposed via a transfer function. The proposed framework elucidates the properties of various algorithms and their relationships. Based on the presented analysis, we propose an efficient model selection algorithm for LDA. We conduct extensive experiments using a collection of high-dimensional data, including text documents, face images, gene expression data, and gene expression pattern images, to evaluate the proposed theories and algorithms.

AB - Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope with the curse of dimensionality. In essence, most of these algorithms employ various techniques to deal with the singularity problem, which occurs when the data dimensionality is larger than the sample size. They have been applied successfully in various applications. However, there is a lack of a systematic study of the commonalities and differences of these algorithms, as well as their intrinsic relationships. In this paper, a unified framework for generalized LDA is proposed via a transfer function. The proposed framework elucidates the properties of various algorithms and their relationships. Based on the presented analysis, we propose an efficient model selection algorithm for LDA. We conduct extensive experiments using a collection of high-dimensional data, including text documents, face images, gene expression data, and gene expression pattern images, to evaluate the proposed theories and algorithms.

UR - http://www.scopus.com/inward/record.url?scp=51949110421&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51949110421&partnerID=8YFLogxK

U2 - 10.1109/CVPR.2008.4587377

DO - 10.1109/CVPR.2008.4587377

M3 - Conference contribution

SN - 9781424422432

BT - 26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

ER -