DocumentCode
2046040
Title
When is non-negative matrix decomposition unique?
Author
Rickard, Scott ; Cichocki, Andrzej
Author_Institution
Complex & Adaptive Syst. Lab., Univ. Coll. Dublin, Dublin
fYear
2008
fDate
19-21 March 2008
Firstpage
1091
Lastpage
1092
Abstract
In this paper, we discuss why non-negative matrix factorization (NMF) potentially works for zero-grounded non-negative components and why it fails when the components are not zero-grounded. We show the demixing process is not uniquely defined (up to the usual permutation/scaling ambiguity) when the original matrices are not zero-grounded. If fact, zero-groundedness alone is not enough. The key observation is that if each component has at least one point for which it is the only active component, the solution is unique. When the non-negative matrices are not zero-grounded, no such point exists and the solution space contains demixtures which are linear combinations of the original components. Thus, the NMF problem has a unique solution for matrices with disjoint components, a condition we call Subset Monomial Disjoint (SMD). The SMD condition is sufficient, but not necessary for NMF to have a unique decomposition, whereas the zero-grounded condition is necessary, but not sufficient.
Keywords
matrix decomposition; source separation; nonnegative matrix decomposition; nonnegative matrix factorization; source seperation; subset monomial disjoint; zero-grounded nonnegative component; Adaptive signal processing; Adaptive systems; Blind source separation; Educational institutions; Independent component analysis; Laboratories; Matrix decomposition; Source separation; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Conference_Location
Princeton, NJ
Print_ISBN
978-1-4244-2246-3
Electronic_ISBN
978-1-4244-2247-0
Type
conf
DOI
10.1109/CISS.2008.4558681
Filename
4558681
Link To Document