Rank-One NMF-Based Initialization for NMF and Relative Error Bounds Under a Geometric Assumption.

IEEE Transactions on Signal Processing(2018)

引用 18|浏览2
暂无评分
摘要
We propose a geometric assumption on nonnegative data matrices such that under this assumption, we are able to provide upper bounds (both deterministic and probabilistic) on the relative error of nonnegative matrix factorization (NMF). The algorithm we propose first uses the geometric assumption to obtain an exact clustering of the columns of the data matrix; subsequently, it employs several rank-...
更多
查看译文
关键词
Signal processing algorithms,Approximation algorithms,Clustering algorithms,Matrix decomposition,Radio frequency,Upper bound,Algorithm design and analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要