Breaking the curse of dimensionality for coupled matrix-tensor factorization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Breaking the curse of dimensionality for coupled matrix-tensor factorization

Résumé

In different application fields, heterogeneous data sets are structured into either matrices or higher-order tensors. In some cases, these structures present the property of having common underlying factors, which is used to improve the efficiency of factor-matrices estimation in the process of the so-called coupled matrix-tensor factorization (CMTF). Many methods target the CMTF problem relying on alternating algorithms or gradient approaches. However, computational complexity remains a challenge when the data sets are tensors of high-order, which is linked to the well-known "curse of dimensionality". In this paper, we present a methodologi-cal approach, using the Joint dImensionality Reduction And Factors rEtrieval (JIRAFE) algorithm for joint factorization of high-order tensor and matrix. This approach reduces the high-order CMTF problem into a set of 3-order CMTF and canonical polyadic decomposition (CPD) problems. The proposed algorithm is evaluated on simulation and compared with a gradient-based method.
Fichier principal
Vignette du fichier
BREAKING THE CURSE OF DIMENSIONALITY FOR COUPLED MATRIX-TENSOR FACTORIZATION.pdf (310.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02417126 , version 1 (18-12-2019)

Identifiants

Citer

Abdelhak Boudehane, Yassine Zniyed, Arthur Tenenhaus, Laurent Le Brusquet, Remy Boyer. Breaking the curse of dimensionality for coupled matrix-tensor factorization. 8th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP 2019), Dec 2019, Le Gosier, Guadeloupe. ⟨10.1109/camsap45676.2019.9022462⟩. ⟨hal-02417126⟩
201 Consultations
284 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More