Canonical Polyadic Decomposition: From 3-way to N-Way
暂无分享,去创建一个
Zhaoshui He | Andrzej Cichocki | Qibin Zhao | Yu Zhang | Guoxu Zhou | A. Cichocki | Zhaoshui He | Yu Zhang | Guoxu Zhou | Qibin Zhao
[1] Andrzej Cichocki,et al. Nonnegative Matrix and Tensor Factorization T , 2007 .
[2] J. Chang,et al. Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .
[3] L. Lathauwer,et al. An enhanced plane search scheme for complex-valued tensor decompositions , 2010 .
[4] Rasmus Bro,et al. The N-way Toolbox for MATLAB , 2000 .
[5] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[6] Andrzej Cichocki,et al. Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation , 2012, IEEE Transactions on Signal Processing.
[7] Andrzej Cichocki,et al. Canonical Polyadic Decomposition Based on a Single Mode Blind Source Separation , 2012, IEEE Signal Processing Letters.
[8] Sameer A. Nene,et al. Columbia Object Image Library (COIL100) , 1996 .
[9] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[10] Lieven De Lathauwer,et al. An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA , 2008, Signal Process..
[11] Hai-Long Wu,et al. On the self‐weighted alternating trilinear decomposition algorithm—the property of being insensitive to excess factors used in calculation , 2001 .
[12] Richard A. Harshman,et al. Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis , 1970 .