A fast two-stage algorithm for non-negative matrix factorization in streaming data
Not on the map. Why?
Abstract (arXiv)
In this article, we study algorithms for nonnegative matrix factorization (NMF) in various applications involving streaming data. Utilizing the continual nature of the data, we develop a fast two-stage algorithm for highly efficient and accurate NMF. In the first stage, an alternating non-negative least squares (ANLS) framework is used, in combination with active set method with warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. The results demonstrate the advantage of our algorithm in finding high-precision solutions.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 21 Jan 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.