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...
Gespeichert in:
| Veröffentlicht in: | 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) S. 5505 - 5509 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.04.2015
|
| Schlagworte: | |
| ISSN: | 1520-6149 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 |