Speeding up PARAFAC : Approximation of tensor rank using the Tucker core
In this paper, the approach of utilizing the core tensor from the Tucker decomposition, in place of theuncompressed tensor, for nding a valid tensor rank for the PARAFAC decomposition is considered.Validity of the proposed method is investigated in terms of error and time consumption. As thesolution...
Main Author: | Arnroth, Lukas |
---|---|
Format: | Others |
Language: | English |
Published: |
Uppsala universitet, Statistiska institutionen
2018
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-353287 |
Similar Items
-
Semi-Blind Receivers for Multi-User Massive MIMO Relay Systems Based on Block Tucker2-PARAFAC Tensor Model
by: Jianhe Du, et al.
Published: (2020-01-01) -
An Alternating Bayesian Approach to PARAFAC Decomposition of Tensors
by: Ming Shi, et al.
Published: (2018-01-01) -
Nonnegative Tensor Completion via Low-Rank Tucker Decomposition: Model and Algorithm
by: Bilian Chen, et al.
Published: (2019-01-01) -
Rank determination in tensor factor model
by: Chen, R., et al.
Published: (2022) -
rTensor: An R Package for Multidimensional Array (Tensor) Unfolding, Multiplication, and Decomposition
by: James Li, et al.
Published: (2018-11-01)