Block Iterative Algorithms for Non-negative Matrix Approximation

Sra, S

doi:10.1109/ICDM.2008.77

Datensatz

DATENSATZ AKTIONENEXPORT

Zur Ablage hinzufügen

Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben

Konferenzbeitrag

Block Iterative Algorithms for Non-negative Matrix Approximation

MPG-Autoren

Es sind keine MPG-Autoren in der Publikation vorhanden

Externe Ressourcen

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4781221
(Verlagsversion)

Volltexte (beschränkter Zugriff)

Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.

Volltexte (frei zugänglich)

Es sind keine frei zugänglichen Volltexte in PuRe verfügbar

Ergänzendes Material (frei zugänglich)

Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar

Zitation

Sra, S. (2009). Block Iterative Algorithms for Non-negative Matrix Approximation. In F. Giannotti, D. Gunopulos, F. Turini, C. Zaniolo, N. Ramakrishnan, & X. Wu (Eds.), 2008 Eighth IEEE International Conference on Data Mining (pp. 1037-1042). Piscataway, NJ, USA: IEEE.

Zitierlink: https://hdl.handle.net/11858/00-001M-0000-0013-C62B-8

Zusammenfassung

In this paper we present new algorithms for non-negative matrix approximation (NMA), commonly known as the NMF problem. Our methods improve upon the well-known methods of Lee Seung~citelee00} for both the Frobenius norm as well the Kullback-Leibler divergence versions of the problem. For the latter problem, our results are especially interesting because it seems to have witnessed much lesser algorithmic progress as compared to the Frobenius norm NMA problem. Our algorithms are based on a particular textbf {block-iterative} acceleration technique for EM, which preserves the multiplicative nature of the updates and also ensures monotonicity. Furthermore, our algorithms also naturally apply to the Bregman-divergence NMA algorithms of~cite{suv.nips. Experimentally, we show that our algorithms outperform the traditional Lee/Seung approach most of the time.