TY  - JOUR
ID  - witeprints3174
UR  - http://digital-library.theiet.org/docserver/fulltext/conference/2013/002/20130050.pdf?expires=1384211572&id=id&accname=guest&checksum=9B3F0C4E2F0476A10F5E50C9D99E6E2A
A1  - de Fréin, Ruairí
Y1  - 2013/07//
N2  - An exact nonnegative matrix decomposition algorithm is proposed. This is achieved by 1) Taking a nonlinear approximation of a sparse real-valued dataset at a given tolerance-to-error constraint, e; 2) Choosing an arbitrary lectic ordering on the rows or column entries; And, then 3) systematically applying a closure operator, so that all closures are selected. Assuming a nonnegative hierarchical closure structure (a Galois lattice) ensures the data has a unique ordered overcomplete dictionary representation. Parts-based constraints on these closures can then be used to specify and supervise the form of the solution. We illustrate that this approach outperforms NMF on two standard NMF datasets: it exhibits the properties described above; It
is correct and exact.
PB  - IET and IEEE
JF  - 24th IET Irish Signals and Systems Conference (ISSC 2013)
VL  - 24
TI  - Ghostbusters: A Parts-based NMF Algorithm
SP  - 1
AV  - public
EP  - 8
ER  -