期刊
COMPUTER VISION AND IMAGE UNDERSTANDING
卷 117, 期 9, 页码 1175-1189出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.cviu.2013.04.003
关键词
Dimensionality reduction; Non-negative matrix factorization; Structure preserving; Basis compactness; Multiplicative update algorithm
资金
- 973 Program [2010CB327905]
- National Natural Science Foundation of China [61272329, 61070104, 61202325]
The problem of dimensionality reduction is to map data from high dimensional spaces to low dimensional spaces. In the process of dimensionality reduction, the data structure, which is helpful to discover the latent semantics and simultaneously respect the intrinsic geometric structure, should be preserved. In this paper, to discover a low-dimensional embedding space with the nature of structure preservation and basis compactness, we propose a novel dimensionality reduction algorithm, called Structure Preserving Non-negative Matrix Factorization (SPNMF). In SPNMF, three kinds of constraints, namely local affinity, distant repulsion, and embedding basis redundancy elimination, are incorporated into the NMF framework. SPNMF is formulated as an optimization problem and solved by an effective iterative multiplicative update algorithm. The convergence of the proposed update solutions is proved. Extensive experiments on both synthetic data and six real world data sets demonstrate the encouraging performance of the proposed algorithm in comparison to the state-of-the-art algorithms, especially some related works based on NMF. Moreover, the convergence of the proposed updating rules is experimentally validated. (C) 2013 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据