A hybrid algorithm for low-rank approximation of nonnegative matrix factorization

Nonnegative matrix factorization (NMF) is a recently developed method for data analysis. So far, most of known algorithms for NMF are based on alternating nonnegative least squares (ANLS) minimization of the squared Euclidean distance between the original data matrix and its low-rank approximation....

Full description

Bibliographic Details

Published in:	Neurocomputing (Amsterdam) Vol. 364; pp. 129 - 137
Main Authors:	Wang, Peitao, He, Zhaoshui, Xie, Kan, Gao, Junbin, Antolovich, Michael, Tan, Beihai
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 28.10.2019
Subjects:	Alternately updating Low-rank approximation Nonnegative matrix factorization Nonnegative Tucker decomposition Alternately updating Nonnegative Tucker decomposition Low-rank approximation Nonnegative matrix factorization
ISSN:	0925-2312, 1872-8286
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!