Accelerated Canonical Polyadic Decomposition Using Mode Reduction
暂无分享,去创建一个
[1] Sameer A. Nene,et al. Columbia Object Image Library (COIL100) , 1996 .
[2] Joos Vandewalle,et al. A Multilinear Singular Value Decomposition , 2000, SIAM J. Matrix Anal. Appl..
[3] Charles Van Loan,et al. Block Tensor Unfoldings , 2011, SIAM J. Matrix Anal. Appl..
[4] Andrzej Cichocki,et al. Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[5] Jian Yang,et al. Sparse Tensor Discriminant Color Space for Face Verification , 2012, IEEE Transactions on Neural Networks and Learning Systems.
[6] Pierre Comon,et al. Independent component analysis, A new concept? , 1994, Signal Process..
[7] Andrzej Cichocki,et al. Canonical Polyadic Decomposition Based on a Single Mode Blind Source Separation , 2012, IEEE Signal Processing Letters.
[8] A. Cichocki,et al. Generalizing the column–row matrix decomposition to multi-way arrays , 2010 .
[9] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[10] J. Chang,et al. Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .
[11] J. Kruskal. Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , 1977 .
[12] Lieven De Lathauwer,et al. On the uniqueness of the canonical polyadic decomposition of third-order tensors : new sufficient conditions , 2011 .
[13] Laurent Albera,et al. Iterative methods for the canonical decomposition of multi-way arrays: Application to blind underdetermined mixture identification , 2011, Signal Process..
[14] P. Comon,et al. Tensor decompositions, alternating least squares and other tales , 2009 .
[15] Haiping Lu,et al. MPCA: Multilinear Principal Component Analysis of Tensor Objects , 2008, IEEE Transactions on Neural Networks.
[16] Shengli Xie,et al. Mixing Matrix Estimation From Sparse Mixtures With Unknown Number of Sources , 2011, IEEE Transactions on Neural Networks.
[17] Lieven De Lathauwer,et al. An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA , 2008, Signal Process..
[18] Yan Liu,et al. Tensor Distance Based Multilinear Locality-Preserved Maximum Information Embedding , 2010, IEEE Transactions on Neural Networks.
[19] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[20] Haiping Lu,et al. Uncorrelated Multilinear Discriminant Analysis With Regularization and Aggregation for Tensor Object Recognition , 2009, IEEE Transactions on Neural Networks.
[21] Zhaoshui He,et al. Canonical Polyadic Decomposition: From 3-way to N-Way , 2012, 2012 Eighth International Conference on Computational Intelligence and Security.
[22] N. Sidiropoulos,et al. On the uniqueness of multilinear decomposition of N‐way arrays , 2000 .
[23] Michael J. Watts,et al. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS Publication Information , 2020, IEEE Transactions on Neural Networks and Learning Systems.
[24] Andrzej Cichocki,et al. Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation , 2012, IEEE Transactions on Signal Processing.
[25] Terrence J. Sejnowski,et al. Blind source separation of more sources than mixtures using overcomplete representations , 1999, IEEE Signal Processing Letters.
[26] 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 .
[27] Rasmus Bro,et al. The N-way Toolbox for MATLAB , 2000 .
[28] Yong Xiang,et al. Nonnegative Blind Source Separation by Sparse Component Analysis Based on Determinant Measure , 2012, IEEE Transactions on Neural Networks and Learning Systems.
[29] Yong Xiang,et al. Time-Frequency Approach to Underdetermined Blind Source Separation , 2012, IEEE Transactions on Neural Networks and Learning Systems.
[30] Joos Vandewalle,et al. On the Best Rank-1 and Rank-(R1 , R2, ... , RN) Approximation of Higher-Order Tensors , 2000, SIAM J. Matrix Anal. Appl..
[31] A. Stegeman,et al. On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition , 2007 .
[32] Zhaoshui He,et al. Minimum-Volume-Constrained Nonnegative Matrix Factorization: Enhanced Ability of Learning Parts , 2011, IEEE Transactions on Neural Networks.
[33] Richard A. Harshman,et al. Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis , 1970 .
[34] Andrzej Cichocki,et al. Nonnegative Matrix and Tensor Factorization T , 2007 .
[35] Sabine Van Huffel,et al. A Combination of Parallel Factor and Independent Component Analysis , 2022 .