Abstract
There have been proposed various types of multiplicative updates for nonnegative matrix factorization. However, these updates have a serious drawback in common: they are not defined for all pairs of nonnegative matrices. Furthermore, due to this drawback, their global convergence in the sense of Zangwill's theorem cannot be proved theoretically. In this paper, we consider slightly modified versions of various multiplicative update rules, that are defined for all pairs of matrices in the domain, and show that many of them have the boundedness property. This property is a necessary condition for update rules to be globally convergent in the sense of Zangwill's theorem.
Original language | English |
---|---|
Title of host publication | 2013 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2013 |
Pages | 252-255 |
Number of pages | 4 |
DOIs | |
Publication status | Published - Dec 1 2013 |
Event | 2013 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2013 - Saint Martin, France Duration: Dec 15 2013 → Dec 18 2013 |
Other
Other | 2013 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2013 |
---|---|
Country | France |
City | Saint Martin |
Period | 12/15/13 → 12/18/13 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications