Regularized Direct Linear Graph Embedding

Linear Graph Embedding (LGE) is the linearization of graph embedding which could explain man of the popular dimensionality reduction algorithms such as LDA, LLE and L PP LGE algorithms have been applied in mans domains successfully, however, those algorithms need a PCA transform in advance to avoid a possible singular problem In this paper, a regularized direct linear graph embedding algorithm is proposed by imposing Tikhonov regularizer on the objective function of LGE Further, ire extract features from the original data set directly by soling common Eigen value problem of symmetric positive semi definite matrix Experimental results demonstrate the effectiveness and robustness of our proposed algorithm