DocumentCode :
67275
Title :
Nonnegative Matrix and Tensor Factorizations : An algorithmic perspective
Author :
Guoxu Zhou ; Cichocki, Andrzej ; Qibin Zhao ; Shengli Xie
Author_Institution :
Brain Sci. Inst., RIKEN, Wako, Japan
Volume :
31
Issue :
3
fYear :
2014
fDate :
May-14
Firstpage :
54
Lastpage :
65
Abstract :
A common thread in various approaches for model reduction, clustering, feature extraction, classification, and blind source separation (BSS) is to represent the original data by a lower-dimensional approximation obtained via matrix or tensor (multiway array) factorizations or decompositions. The notion of matrix/tensor factorizations arises in a wide range of important applications and each matrix/tensor factorization makes different assumptions regarding component (factor) matrices and their underlying structures. So choosing the appropriate one is critical in each application domain. Approximate low-rank matrix and tensor factorizations play fundamental roles in enhancing the data and extracting latent (hidden) components.
Keywords :
approximation theory; matrix decomposition; statistical analysis; tensors; blind source separation; data enhancement; feature extraction; latent component extraction; model reduction; nonnegative matrix; pattern classification; pattern clustering; rank matrix approximation; tensor factorization; Approximation methods; Clustering; Feature extraction; Matrix decomposition; Signal processing algorithms; Source separation; Sparse matrices; Tensile stress;
fLanguage :
English
Journal_Title :
Signal Processing Magazine, IEEE
Publisher :
ieee
ISSN :
1053-5888
Type :
jour
DOI :
10.1109/MSP.2014.2298891
Filename :
6784087
Link To Document :
بازگشت