Graph-Laplacian PCA: Closed-Form Solution and Robustness
Authors:
- Bo JiangBJBo Jiang
- Chris DingCDChris Ding
- Bio LuoBLBio Luo
- Jin TangJTJin Tang
- 1 June 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 3492-3498
Abstract
Principal Component Analysis (PCA) is a widely used to learn a low-dimensional representation. In many applications, both vector data X and graph data W are available. Laplacian embedding is widely used for embedding graph data. We propose a graph-Laplacian PCA (gLPCA) to learn a low dimensional representation of X that incorporates graph structures encoded in W. This model has several advantages: (1) It is a data representation model. (2) It has a compact closed-form solution and can be efficiently computed. (3) It is capable to remove corruptions. Extensive experiments on 8 datasets show promising results on image reconstruction and significant improvement on clustering and classification.Keywords
This publication has 10 references indexed in Scilit:
- Towards Structural Sparsity: An Explicit l2/l0 Approach2010
- Convex and Semi-Nonnegative Matrix FactorizationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- R1-PCA2006
- K-means clustering via principal component analysis2004
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space AlignmentSIAM Journal on Scientific Computing, 2004
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Spectral K-way ratio-cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- An r-Dimensional Quadratic Placement AlgorithmManagement Science, 1970