Parallelizable PARAFAC decomposition of 3-way tensors
This paper introduces a new PARAFAC algorithm for a class of third-order tensors. Particularly, the proposed algorithm is based on subspace estimation and solving a non-symmetrical joint diagonalization problem. To deal with large scale problem, a procedure for overcoming scale and permutation ambig...
Saved in:
| Published in: | 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) pp. 5505 - 5509 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.04.2015
|
| Subjects: | |
| ISSN: | 1520-6149 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper introduces a new PARAFAC algorithm for a class of third-order tensors. Particularly, the proposed algorithm is based on subspace estimation and solving a non-symmetrical joint diagonalization problem. To deal with large scale problem, a procedure for overcoming scale and permutation ambiguities is proposed in a parallel computing scheme leading to a significant cost reduction of our method. Performance comparison with some state-of-the-art algorithms produces promising results. |
|---|---|
| ISSN: | 1520-6149 |
| DOI: | 10.1109/ICASSP.2015.7179024 |