Change search
ReferencesLink to record
Permanent link

Direct link
Ghostbusters: A Parts-based NMF Algorithm
Telecommunications Software and Systems Group, WIT, Ireland.ORCID iD: 0000-0002-3912-1470
2013 (English)In: IEEE Irish Signals and Systems Conference / [ed] IET, IEEE, IET, 2013, 1-8 p.Conference paper (Refereed)
Abstract [en]

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, c; Choosing an arbitrary lectic ordering on the rows or column entries; And, then 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.

Place, publisher, year, edition, pages
IET, 2013. 1-8 p.
Keyword [en]
Nonnegative Matrix Factorization, Lectic Orderings, Unique Solutions
National Category
Computer Systems Signal Processing
Research subject
Applied and Computational Mathematics
URN: urn:nbn:se:kth:diva-173815DOI: 10.1049/ic.2013.0050OAI: diva2:855009
IEEE Irish Signals and Systems Conference

QC 20150921

Available from: 2015-09-18 Created: 2015-09-18 Last updated: 2015-09-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
de Fréin, Ruairí
Computer SystemsSignal Processing

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link