...
首页> 外文期刊>ACM SIGPLAN Notices: A Monthly Publication of the Special Interest Group on Programming Languages >A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization
【24h】

A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

机译:非负矩阵分解的高性能并行算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A approximate to WH. NMF is a useful tool for many applications in di ff erent domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of e ffi cient distributed algorithms to solve the problem for big data sets.
机译:非负矩阵分解(NMF)是确定给定输入矩阵A的两个非负低秩因子W和H的问题,以使A近似于WH。 NMF是不同领域中许多应用程序的有用工具,例如文本挖掘中的主题建模,视频分析中的背景分离以及社交网络中的社区检测。尽管它在数据挖掘社区中很受欢迎,但仍然缺乏有效的分布式算法来解决大数据集的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号