Multifrontal Non-negative Matrix Factorization
Non-negative matrix factorization (Nmf) is an important tool in high-performance large scale data analytics with applications ranging from community detection, recommender system, feature detection and linear and non-linear unmixing. While traditional Nmf works well when the data set is relatively dense, however, it may not extract sufficient structure when the data is extremely sparse. Specifically, traditional Nmf fails to exploit the structured sparsity of the large and sparse data sets resulting in dense factors. We propose a new algorithm for performing Nmf on sparse data that we call multifrontal Nmf (Mf-Nmf) since it borrows several ideas from the multifrontal method for unconstrained factorization (e.g. LU and QR). We also present an efficient shared memory parallel implementation of Mf-Nmf and discuss its performance and scalability. We conduct several experiments on synthetic and realworld datasets and demonstrate the usefulness of the algorithm by comparing it against standard baselines. We obtain a speedup of 1.2x to 19.5x on 24 cores with an average speed up of 10.3x across all the real world datasets.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1649537
- Resource Relation:
- Journal Volume: 12043; Conference: 13th International Conference on Parallel Processing and Applied Mathematics (PPAM) - BIALYSTOK, , Poland - 9/8/2019 12:00:00 PM-9/11/2019 4:00:00 AM
- Country of Publication:
- United States
- Language:
- English
Similar Records
High performance sparse multifrontal solvers on modern GPUs
Partitioning and Communication Strategies for Sparse Non-negative Matrix Factorization