Some Issues in Computing the CP Decomposition of NonNegative Tensors
暂无分享,去创建一个
[1] J. Kruskal. Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , 1977 .
[2] W. Hackbusch. Tensor Spaces and Numerical Tensor Calculus , 2012, Springer Series in Computational Mathematics.
[3] Giorgio Ottaviani,et al. An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors , 2014, SIAM J. Matrix Anal. Appl..
[4] N. Sidiropoulos,et al. On the uniqueness of multilinear decomposition of N‐way arrays , 2000 .
[5] Pierre Comon,et al. Tensors : A brief introduction , 2014, IEEE Signal Processing Magazine.
[6] Pierre Comon,et al. Nonnegative approximations of nonnegative tensors , 2009, ArXiv.
[7] Nikos D. Sidiropoulos,et al. A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization , 2015, IEEE Transactions on Signal Processing.
[8] J. Landsberg. Tensors: Geometry and Applications , 2011 .
[9] Pierre Comon,et al. Handbook of Blind Source Separation: Independent Component Analysis and Applications , 2010 .
[10] Joel E. Cohen,et al. Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .
[11] E. C. Ron,et al. From Vectors to Tensors , 2005 .
[12] Pierre Comon,et al. Fast Decomposition of Large Nonnegative Tensors , 2015, IEEE Signal Processing Letters.
[13] Pierre Comon,et al. Uniqueness of Nonnegative Tensor Approximations , 2014, IEEE Transactions on Information Theory.