期刊
PATTERN RECOGNITION
卷 42, 期 5, 页码 918-928出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2008.08.026
关键词
Non-negative matrix factorization; Geometry; Ill-posedness; Generative model; Component analysis
资金
- NSF VIGRE [DMS-9810751]
Non-negative matrix factorization (NMF) has been proposed as a mathematical tool for identifying the components of a dataset. However, popular NMF algorithms tend to operate slowly and do not always identify the components which are most representative of the data. In this paper, an alternative algorithm for performing NMF is developed using the geometry of the problem. The computational costs of the algorithm are explored, and it is shown to successfully identify the components of a simulated dataset. The development of the geometric algorithm framework illustrates the ill-posedness of the NMF problem and suggests that NMF is not sufficiently constrained to be applied successfully outside of a particular class of problems. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据