Abstract
Symmetric nonnegativematrix factorization (SNMF) is equivalent to computing a symmetric nonnegative low rank approximation of a data similarity matrix. It inherits the good data interpretability of the well-known nonnegative matrix factorization technique and has better ability of clustering nonlinearly separable data. In this paper, we focus on the algorithmic aspect of the SNMF problem and propose simple inexact block coordinate decentmethods to address the problem, leading to both serial and parallel algorithms. The proposed algorithms have guaranteed convergence to stationary solutions and can efficiently handle large-scale and/or sparse SNMF problems. Extensive simulations verify the effectiveness of the proposed algorithms compared to recent state-of-the-art algorithms.
Original language | English (US) |
---|---|
Article number | 7990154 |
Pages (from-to) | 5995-6008 |
Number of pages | 14 |
Journal | IEEE Transactions on Signal Processing |
Volume | 65 |
Issue number | 22 |
DOIs | |
State | Published - Nov 15 2017 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.
Keywords
- Block coordinate decent
- Block successive upper-bounding minimization
- Parallel algorithm
- Stationary solution
- Symmetric nonnegative matrix factorization