0396775 20240111140835.220131031235959.9 000324342900017 10.1109/TSP.2013.2269046 14 s. P cav_un_epca*02567271053-587X6119 (2013)4847-4860 tensor factorization canonical polyadic decomposition Cramer-Rao bound cav_un_auth*0274170 Phan A. H. JP cav_un_auth*0101212 Tichavský Petr Stochastická informatika Department of Stochastic Informatics SI SI UTIA-B Department of Stochastic Informatics Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0274171 Cichocki A. JP http://library.utia.cas.cz/separaty/2013/SI/tichavsky-0396775.pdf 3.98 MB GA102/09/1278 GA ČR cav_un_auth*0253174 In general, algorithms for order-3 CANDECOMP/ PARAFAC (CP), also coined canonical polyadic decomposition (CPD), are easy to implement and can be extended to higher order CPD. Unfortunately, the algorithms become computationally demanding, and they are often not applicable to higher order and relatively large scale tensors. In this paper, by exploiting the uniqueness of CPD and the relation of a tensor in Kruskal form and its unfolded tensor, we propose a fast approach to deal with this problem. Instead of directly factorizing the high order data tensor, the method decomposes an unfolded tensor with lower order, e.g., order-3 tensor. On the basis of the order-3 estimated tensor, a structured Kruskal tensor, of the same dimension as the data tensor, is then generated, and decomposed to find the final solution using fast algorithms for the structured CPD. In addition, strategies to unfold tensors are suggested and practically verified in the paper. 2014 BB 3 RVO:67985556 http://hdl.handle.net/11104/0225514 ENGINEERINGELECTRICALELECTRONIC 3.592 0.439 7.II 0.07199 1.62 22913 508 2.074 Q1 94.605 90.927 Q1* Q1* 2013 000324342900017 WOS 3.98 MB cav_un_epca*0256727 IEEE Transactions on Signal Processing 1053-587X 1941-0476 Roč. 61 č. 19 2013 4847 4860