A convergent algorithm for orthogonal nonnegative matrix factorization

This paper proposes a convergent algorithm for nonnegative matrix factorization (NMF) with orthogonality constraint on the factors. We design the algorithm based on the additive update rule algorithm for the standard NMF proposed by Lee and Seung, and derive the convergent version by generalizing th...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics 2014-04, Vol.260, p.149-166
Main Author: Mirzal, Andri
Format: Article
Language:English
Subjects:
Clustering methods
Convergent algorithm
Nonnegative matrix factorization
Orthogonality constraint
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a convergent algorithm for nonnegative matrix factorization (NMF) with orthogonality constraint on the factors. We design the algorithm based on the additive update rule algorithm for the standard NMF proposed by Lee and Seung, and derive the convergent version by generalizing the convergence proof of the algorithm developed by Lin. Further we use the proposed algorithms to improve clustering capability of the standard NMF using the Reuter document corpus, a standard dataset in clustering research.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2013.09.022