Least-Squares Regulation Based Graph Embedding

A large family of algorithms named graph embedding is widely accepted as an effective technique designed to provide better solutions to the problem of dimensionality reduction. Existing graph embedding algorithms mainly consider obtaining projection directions through preserving local geometrical structure of data. In this paper, a regulation formulation known as Least-Squares Reconstruction Errors, to unify various graph embedding methods within a common regulation framework for preserving both local and global structures, is proposed. With its properties of Least-Squares regulation, orthogonality constraint to data distributions and tensor extensions of supervised or semi-supervised scenarios, this common regulation framework makes a tradeoff between intrinsic geometrical structure and the global structure. Our experiments demonstrated that, our proposed method have better performances in keeping lower dimensional subspaces and higher classification results.

[1]  B. Scholkopf,et al.  Fisher discriminant analysis with kernels , 1999, Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop (Cat. No.98TH8468).

[2]  Shuicheng Yan,et al.  Neighborhood preserving embedding , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[3]  Yuxiao Hu,et al.  Face recognition using Laplacianfaces , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Yinglin Wang,et al.  Low rank approximation with sparse integration of multiple manifolds for data representation , 2014, Applied Intelligence.

[6]  Xuelong Li,et al.  Patch Alignment for Dimensionality Reduction , 2009, IEEE Transactions on Knowledge and Data Engineering.

[7]  Jeng-Shyang Pan,et al.  Kernel class-wise locality preserving projection , 2008, Inf. Sci..

[8]  Nicolas Le Roux,et al.  Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering , 2003, NIPS.

[9]  Yu Qiao,et al.  Face recognition based on gradient gabor feature and Efficient Kernel Fisher analysis , 2010, Neural Computing and Applications.

[10]  Edwin R. Hancock,et al.  Spectral embedding of graphs , 2003, Pattern Recognit..

[11]  Xiaoyang Tan,et al.  Pattern Recognition , 2016, Communications in Computer and Information Science.

[12]  Ziqiang Wang,et al.  Face Recognition Using Kernel-Based NPE , 2008, 2008 International Conference on Computer Science and Software Engineering.

[13]  Jiwen Lu,et al.  Regularized Locality Preserving Projections and Its Extensions for Face Recognition , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  Huijun Gao,et al.  Sparse data-dependent kernel principal component analysis based on least squares support vector machine for feature extraction and recognition , 2011, Neural Computing and Applications.

[15]  Fernando De la Torre,et al.  A Least-Squares Framework for Component Analysis , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Jian Yang,et al.  Constructing PCA Baseline Algorithms to Reevaluate ICA-Based Face-Recognition Performance , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[17]  Jian Yang,et al.  BDPCA plus LDA: a novel fast feature extraction technique for face recognition , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[18]  Anil K. Jain,et al.  Statistical Pattern Recognition: A Review , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Kun Zhou,et al.  Locality Sensitive Discriminant Analysis , 2007, IJCAI.