Novel algorithm for non-negative matrix factorization

DOI10.1142/S1793005715400013MaRDI QIDQ4598034zbMATHOpenAlexFDO

Authors Tran Dang Hien, Do Van Tuan, Pham van At, Le Hung Son

Publication date 19 December 2017

Published in New Mathematics and Natural Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.5647

zbMATH Keywords

NMFnon-negative matrix factorizationKKTKrush-Kuhn-Tucker optimal conditionstationarity pointupdating an element of matrixupdating matrices

Mathematics Subject Classification ID

Factorization of matrices (15A23)

Abstract: Nonnegative matrix factorization (NMF) is an emerging technique with a wide spectrum of potential applications in data analysis. Mathematically, NMF can be formulated as a minimization problem with nonnegative constraints. This problem is currently attracting much attention from researchers for theoretical reasons and for potential applications. Currently, the most popular approach to solve NMF is the multiplicative update algorithm proposed by D.D. Lee and H.S. Seung. In this paper, we propose an additive update algorithm, that has faster computational speed than the algorithm of D.D. Lee and H.S. Seung.

Recommendations

• Non-monotone projection gradient method for non-negative matrix factorization
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Non-negative matrix factorization based on estimation of distribution algorithm
• Algorithms and applications for approximate nonnegative matrix factorization
• Global convergence of modified multiplicative updates for nonnegative matrix factorization

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
• Nonnegative matrix factorization for spectral data analysis
• On the Goldstein-Levitin-Polyak gradient projection method
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints

Cited in

(15)

• scientific article; zbMATH DE number 7295421 (Why is no real title available?)
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Non-monotone projection gradient method for non-negative matrix factorization
• Non-negative matrix factorization based on estimation of distribution algorithm
• A fast two-stage algorithm for non-negative matrix factorization in smoothly varying data
• Algorithms and applications for approximate nonnegative matrix factorization
• Multiplicative Updates for Nonnegative Quadratic Programming
• Global convergence of modified multiplicative updates for nonnegative matrix factorization
• Image processing using Newton-based algorithm of nonnegative matrix factorization
• A non-negative matrix factorization model based on the zero-inflated Tweedie distribution
• scientific article; zbMATH DE number 7028989 (Why is no real title available?)
• scientific article; zbMATH DE number 6415466 (Why is no real title available?)
• A dynamical system approach for continuous nonnegative matrix factorization
• An inexact update method with double parameters for nonnegative matrix factorization
• Updating/downdating the NonNegative Matrix Factorization

This page was built for publication: Novel algorithm for non-negative matrix factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598034)