Parallel Nonnegative Matrix Factorization via Newton Iteration

Author:

Flatz Markus1,Vajteršic Marián12

Affiliation:

1. Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria

2. Mathematical Institute, Department of Informatics, Slovak Academy of Sciences, Dúbravská cesta 9, 841 04 Bratislava, Slovakia

Abstract

The goal of Nonnegative Matrix Factorization (NMF) is to represent a large nonnegative matrix in an approximate way as a product of two significantly smaller nonnegative matrices. This paper shows in detail how an NMF algorithm based on Newton iteration can be derived using the general Karush-Kuhn-Tucker (KKT) conditions for first-order optimality. This algorithm is suited for parallel execution on systems with shared memory and also with message passing. Both versions were implemented and tested, delivering satisfactory speedup results.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Two-dimensional data partitioning for non-negative matrix tri-factorization;Big Data Research;2024-08

2. NMTF-LTM: Towards an Alignment of Semantics for Lifelong Topic Modeling;IEEE Transactions on Knowledge and Data Engineering;2023-10-01

3. Parallel Non-negative Matrix Tri-Factorization for Text Data Co-clustering;IEEE Transactions on Knowledge and Data Engineering;2022

4. Parallel Nonnegative Matrix Factorization Based on Newton Iteration with Improved Convergence Behavior;Parallel Processing and Applied Mathematics;2018

5. Improvements in Approximation Performance and Parallelization of Nonnegative Matrix Factorization with Newton Iteration;2017 International Conference on High Performance Computing & Simulation (HPCS);2017-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3