Title
Seeking an appropriate alternative least squares algorithm for nonnegative tensor factorizations: A novel recursive solution for nonnegative quadratic programming and NTF
Abstract
Alternative least squares (ALS) algorithm is considered as a “work-horse” algorithm for general tensor factorizations. A common form of this algorithm for nonnegative tensor factorizations (NTF) is always combined with a nonlinear projection (rectifier) to enforce nonnegative entries during the estimation. Such simple modification often provides acceptable results for general data. However, this does not establish an appropriate ALS algorithm for NTF. This kind of ALS algorithm often converges slowly, or cannot converge to the desired solution, especially for collinear data. To this end, in this paper, we reinvestigate the nonnegative quadratic programming, propose a recursive method for solving this problem. Then, we formulate a novel ALS algorithm for NTF. The validity and high performance of the proposed algorithm has been confirmed for difficult benchmarks, and also in an application of object classification, and analysis of EEG signals.
Year
DOI
Venue
2012
10.1007/s00521-011-0652-0
Neural Computing and Applications
Keywords
DocType
Volume
appropriate ALS algorithm,ALS algorithm,squares algorithm,nonnegative tensor factorization,nonnegative entry,proposed algorithm,nonnegative quadratic programming,novel recursive solution,collinear data,appropriate alternative,novel ALS algorithm,general data,general tensor factorization
Journal
21
Issue
ISSN
Citations 
4
0941-0643
3
PageRank 
References 
Authors
0.44
13
2
Name
Order
Citations
PageRank
Anh Huy Phan182851.60
Andrzej Cichocki25228508.42