Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 3,031

The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.

Graph Embedding and Extensions: A General Framework for Dimensionality Reduction

Yan, Shuicheng, Xu, Dong, Zhang, Benyu, Zhang, Hong-jiang, Yang, Qiang, Lin, Stephen·2007·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

Over the past few decades, a large family of algorithms - supervised or unsupervised; stemming from statistics or geometry theory - has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called Marginal Fisher Analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional Linear Discriminant Analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpami.2007.250598

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 11

  1. 10.1109/TPAMI.2004.37 · doi:10.1109/tpami.2004.37
  2. ye, 2005, Two-Dimensional Linear Discriminant Analysis, Advances in neural information processing systems, 17, 1569
  3. 10.1145/1015330.1015347 · doi:10.1145/1015330.1015347
  4. luettin, 1998, Evaluation Protocol for the Extended M2VTS Database (XM2VTS), DMI for Perceptual Artificial Intelligence
  5. 1994, The Olivetti & Oracle Research Laboratory Face Database of Faces
  6. 10.1007/978-3-540-24670-1_10 · doi:10.1007/978-3-540-24670-1_10
  7. yan, 2005, Coupled Kernel-Based Subspace Learning, Proc Int'l Conf Computer Vision and Pattern Recognition, 1, 645
  8. fu, 2005, Locally linear embedded eigenspace analysis
  9. hand, 1982, Kernel Discriminant Analysis
  10. batur, 2001, Linear Subspaces for Illumination Robust Face Recognition, Proc IEEE Int'l Conf Computer Vision and Pattern Recognition, 2, 296
  11. teh, 2002, Automatic Alignment of Hidden Representations, Advances in Neural Information Processing System, 15, 841

Cited by

See all 3,031

Metadata

Authors
Yan, S., Xu, D., Zhang, B., Zhang, H.-J., Yang, Q., & Lin, S.
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2007-01
Volume
29
Issue
1
Pages
40-51
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
OpenAlex
W3148981562
Cited by
3,031
References
24
FWCI
89.39
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.