暂无分享,去创建一个
Andrzej Cichocki | Danilo P. Mandic | André Uschmajew | Anh Huy Phan | Petr Tichavský | Gheorghe Luta | A. Cichocki | P. Tichavský | A. Uschmajew | D. Mandic | A. Phan | G. Luta
[1] J. Chang,et al. Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .
[2] Andreas Schadschneider,et al. Equivalence and solution of anisotropic spin-1 models and generalized t-J fermion models in one dimension , 1991 .
[3] Andrzej Cichocki,et al. Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysis , 2014, IEEE Signal Processing Magazine.
[4] 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..
[5] Reinhold Schneider,et al. The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format , 2012, SIAM J. Sci. Comput..
[6] L. Tucker,et al. Some mathematical notes on three-mode factor analysis , 1966, Psychometrika.
[7] Reinhold Schneider,et al. Tensor completion in hierarchical tensor representations , 2014, ArXiv.
[8] Andrzej Cichocki,et al. On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach , 2012, LVA/ICA.
[9] Andrzej Cichocki,et al. Tensor Deflation for CANDECOMP/PARAFAC— Part I: Alternating Subspace Update Algorithm , 2015, IEEE Transactions on Signal Processing.
[10] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[11] Felix J. Herrmann,et al. Optimization on the Hierarchical Tucker manifold – Applications to tensor completion , 2014, Linear Algebra and its Applications.
[12] Lieven De Lathauwer,et al. Decompositions of a Higher-Order Tensor in Block Terms - Part I: Lemmas for Partitioned Matrices , 2008, SIAM J. Matrix Anal. Appl..
[13] G. Vidal. Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.
[14] Liqing Zhang,et al. Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[15] Andrzej Cichocki,et al. Nonnegative Matrix and Tensor Factorization T , 2007 .
[16] Daniel Kressner,et al. Low-Rank Tensor Methods for Communicating Markov Processes , 2014, QEST.
[17] S. V. Dolgov,et al. ALTERNATING MINIMAL ENERGY METHODS FOR LINEAR SYSTEMS IN HIGHER DIMENSIONS∗ , 2014 .
[18] Eugene E. Tyrtyshnikov,et al. Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions , 2009, SIAM J. Sci. Comput..
[19] R. Harshman,et al. Modeling multi‐way data with linearly dependent loadings , 2009 .
[20] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[21] Bart Vandereycken,et al. Low-rank tensor completion by Riemannian optimization , 2014 .
[22] White,et al. Density-matrix algorithms for quantum renormalization groups. , 1993, Physical review. B, Condensed matter.
[23] Ivan Oseledets,et al. Tensor-Train Decomposition , 2011, SIAM J. Sci. Comput..
[24] André Lima Férrer de Almeida,et al. Overview of constrained PARAFAC models , 2014, EURASIP J. Adv. Signal Process..
[25] Daniel Kressner,et al. Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems , 2014, SIAM J. Sci. Comput..
[26] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..
[27] Lars Grasedyck,et al. Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format , 2015, SIAM J. Sci. Comput..
[28] Andrzej Cichocki,et al. Tensor Deflation for CANDECOMP/PARAFAC. Part 3: Rank Splitting , 2015, ArXiv.
[29] Richard A. Harshman,et al. Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis , 1970 .