Regularized Direct Linear Graph Embedding

摘要：

Linear Graph Embedding (LGE) is the linearization of graph embedding, which could explain many of the popular dimensionality reduction algorithms such as LDA, LLE and LPP. LGE algorithms have been applied in many 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, we extract features from the original data set directly by solving common Eigen value problem of symmetric positive semi definite matrix. Experimental results demonstrate the effectiveness and robustness of our proposed algorithm.

关键词： graph embeding linear dimension reduction linear graph embedding

作者: Jiangfeng Chen Baozong Yuan

作者单位: Institute of Information Science, Beijing Jiaotong University, Beijing, China 100044

会议类型: 国际会议

会议名称: 2010 The IET 3rd International Conference on Wireless,Mobile & Multimedia Networks(第三届IET无线移动及多媒体网络国际会议 ICWMMN 2010)

会议地点: 北京

会议语种:英文

页码: 357-360

在线出版日期: 2010-09-26（万方平台首次上网日期，不代表论文的发表时间）