.png){kind=icon}
返回
Randomized nonnegative matrix factorization
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2018.01.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonnegative matrix factorization (NMF) is a powerful tool for data mining. However, the emergence of 'big data' has severely challenged our ability to compute this fundamental decomposition using deterministic algorithms. This paper presents a randomized hierarchical alternating least squares (HALS) algorithm to compute the NMF. By deriving a smaller matrix from the nonnegative input data, a more efficient nonnegative decomposition can be computed. Our algorithm scales to big data applications while attaining a near-optimal factorization, i.e., the algorithm scales with the target rank of the data rather than the ambient dimension of measurement space. The proposed algorithm is evaluated using synthetic and real world data and shows substantial speedups compared to deterministic HALS. (c) 2018 Elsevier B.V. All rights reserved.
Keyword:
NMF
Randomized algorithm
Dimension reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
On single-phase status and segregation of an as-solidified septenary refractory high entropy alloyOAAI
OAAI分享收藏Physiological Arousal of Beginning Counselors In Relation To Disabled And Non-Disabled Clients与残疾和非残疾客户有关的初级辅导员的生理唤醒
PREAI
分享收藏Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
查看更多内容