Name
Abstract | ||
|---|---|---|
Non-negative 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 non-negative constraints. This problem attracts 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 Lee and Seung. In this paper, we propose an additive update algorithm that has a faster computational speed than Lee and Seung's multiplicative update algorithm. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1142/S1793005715400013 | NEW MATHEMATICS AND NATURAL COMPUTATION |
Keywords | DocType | Volume |
NMF, non-negative matrix factorization, KKT, Krush-Kuhn-Tucker optimal condition, the stationarity point, updating an element of matrix, updating matrices | Journal | 11 |
Issue | ISSN | Citations |
2 | 1793-0057 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tran Dang Hien | 1 | 1 | 1.04 |
| Do Van Tuan | 2 | 1 | 2.05 |
| Pham Van At | 3 | 1 | 1.71 |
| le hung son | 4 | 0 | 0.34 |