期刊
NEURAL PROCESSING LETTERS
卷 46, 期 2, 页码 427-449出版社
SPRINGER
DOI: 10.1007/s11063-017-9598-2
关键词
NMF; Concept factorization; Graph regularized; Local coordinate coding; Image clustering
资金
- National Natural Science Foundation of China [61373063, 61233011, 61125305, 61375007, 61220301]
- National Basic Research Program of China [2014CB349303]
- Natural Science Foundation of Jiangsu Province [BK20150867]
- Natural Science Research Foundation for Jiangsu Universities [13KJB510022]
- Talent Introduction Foundation
- Natural Science Foundation of Nanjing University of Posts and Telecommunications [NY212014, NY212039, NY215125]
Existing matrix factorization based techniques, such as nonnegative matrix factorization and concept factorization, have been widely applied for data representation. In order to make the obtained concepts to be as close to the original data points as possible, one state-of-the-art method called locality constraint concept factorization is put forward, which represent the data by a linear combination of only a few nearby basis concepts. But its locality constraint does not well reveal the intrinsic data structure since it only requires the concept to be as close to the original data points as possible. To address these problems, by considering the manifold geometrical structure in local concept factorization via graph-based learning, we propose a novel algorithm, called graph-regularized local coordinate concept factorization (GRLCF). By constructing a parameter-free graph using constrained Laplacian rank (CLR) algorithm, we also present an extension of GRLCF algorithm as . Moreover, we develop the iterative updating optimization schemes, and provide the convergence proof of our optimization scheme. Since GRLCF simultaneously considers the geometric structures of the data manifold and the locality conditions as additional constraints, it can obtain more compact and better structured data representation. Experimental results on ORL, Yale and Mnist image datasets demonstrate the effectiveness of our proposed algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据