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
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.
Integrity signals
Registry
Cites
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.
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
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Belhumeur, P. N., Hespanha, J. P., & Kriegman, D. J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598228 · Cited by 11,707
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Face recognition using eigenfaces
Turk, M. A., & Pentland, A. P. (2002) · Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1991.139758 · Cited by 5,197
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
Two-dimensional pca: a new approach to appearance-based face representation and recognition
Yang, J., Zhang, D., Frangi, A. F., & Yang, J.-Y. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1261097 · Cited by 3,563
An introduction to kernel-based learning algorithms
Muller, K.-R., Mika, S., Ratsch, G., Tsuda, K., & Scholkopf, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.914517 · Cited by 3,473
Face recognition using Laplacianfaces
He, X., Yan, S., Hu, Y., Niyogi, P., & Zhang, H.-J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.55 · Cited by 3,264
Self-citationMartinez, A. M., & Kak, A. C. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.908974 · Cited by 3,249
The CMU pose, illumination, and expression database
Sim, T., Baker, S., & Bsat, M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1251154 · Cited by 1,783
A direct LDA algorithm for high-dimensional data — with application to face recognition
Yu, H., & Yang, J. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00162-x · Cited by 1,578
Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering
Bengio, Y., Paiement, J.-F., Vincent, P., Delalleau, O., Roux, N. L., & Ouimet, M. (2003) · Cited by 894
Moghaddam, B., Jebara, T., & Pentland, A. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00179-x · Cited by 612
A kernel view of the dimensionality reduction of manifolds
Ham, J., Lee, D. D., Mika, S., & Schölkopf, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015417 · Cited by 532
Dual-space linear discriminant analysis for face recognition
Wang, X., & Tang, X. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315214 · Cited by 444
Discriminant Analysis with Tensor Representation
Yan, S., Xu, D., Yang, Q., Zhang, L., Tang, X., & Zhang, H.-J. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.131 · Cited by 183
Self-citationTensorTextures: multilinear image-based rendering
Vasilescu, M. A. O., & Terzopoulos, D. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015725 · Cited by 167
Continuous nonlinear dimensionality reduction by kernel eigenmaps
Brand, M. (2003) · Cited by 60
Xu, D., Yan, S., Zhang, L., Liu, Z., & Zhang, H. (2004) · Cited by 18
Self-citation
Research works printed but not linked: 11
- 10.1109/TPAMI.2004.37 · doi:10.1109/tpami.2004.37
- ye, 2005, Two-Dimensional Linear Discriminant Analysis, Advances in neural information processing systems, 17, 1569
- 10.1145/1015330.1015347 · doi:10.1145/1015330.1015347
- luettin, 1998, Evaluation Protocol for the Extended M2VTS Database (XM2VTS), DMI for Perceptual Artificial Intelligence
- 1994, The Olivetti & Oracle Research Laboratory Face Database of Faces
- 10.1007/978-3-540-24670-1_10 · doi:10.1007/978-3-540-24670-1_10
- yan, 2005, Coupled Kernel-Based Subspace Learning, Proc Int'l Conf Computer Vision and Pattern Recognition, 1, 645
- fu, 2005, Locally linear embedded eigenspace analysis
- hand, 1982, Kernel Discriminant Analysis
- batur, 2001, Linear Subspaces for Illumination Robust Face Recognition, Proc IEEE Int'l Conf Computer Vision and Pattern Recognition, 2, 296
- teh, 2002, Automatic Alignment of Hidden Representations, Advances in Neural Information Processing System, 15, 841
Cited by
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
metapath2vec: Scalable Representation Learning for Heterogeneous Networks
Dong, Y., Chawla, N. V., & Swami, A. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098036 · Cited by 2,210
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Graph convolutional networks: a comprehensive review
Zhang, S., Tong, H., Xu, J., & Maciejewski, R. (2019) · Computational Social Networks · doi:10.1186/s40649-019-0069-y · Cited by 1,888
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.