Počet záznamů: 1
CANDECOMP/PARAFAC Decomposition of High-Order Tensors Through Tensor Reshaping
- 1.
SYSNO ASEP 0396775 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název CANDECOMP/PARAFAC Decomposition of High-Order Tensors Through Tensor Reshaping Tvůrce(i) Phan, A. H. (JP)
Tichavský, Petr (UTIA-B) RID, ORCID
Cichocki, A. (JP)Celkový počet autorů 3 Zdroj.dok. IEEE Transactions on Signal Processing - ISSN 1053-587X
Roč. 61, č. 19 (2013), s. 4847-4860Poč.str. 14 s. Forma vydání Tištěná - P Jazyk dok. eng - angličtina Země vyd. US - Spojené státy americké Klíč. slova tensor factorization ; canonical polyadic decomposition ; Cramer-Rao bound Vědní obor RIV BB - Aplikovaná statistika, operační výzkum CEP GA102/09/1278 GA ČR - Grantová agentura ČR Institucionální podpora UTIA-B - RVO:67985556 UT WOS 000324342900017 DOI 10.1109/TSP.2013.2269046 Anotace 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. Pracoviště Ústav teorie informace a automatizace Kontakt Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Rok sběru 2014
Počet záznamů: 1