POPLAR: Parafac2 decOmPosition using auxiLiAry infoRmation
ID:147 Submission ID:100 View Protection:ATTENDEE Updated Time:2020-08-05 10:17:28 Hits:398 Oral Presentation

Start Time:2020-06-08 14:20 (Asia/Shanghai)

Duration:20min

Session:[S] Special Session » [SS04] Structured Tensor And Matrix Methods For Sensing, Communications, And Machine Learning

Video No Permission

Tips: The file permissions under this presentation are only for participants. You have not logged in yet and cannot view it temporarily.

Abstract
PARAFAC2 is a powerful method for analyzing multi-modal data consisting of irregular frontal slices. In this work, we propose POPLAR method that imposes graph Laplacians constraints induced by the similarity symmetric tensor as auxiliary information to force decomposition factors to behave similarly and the method is developed using AO-ADMM for 3-way PARAFAC2 tensor decomposition. To the best of our knowledge, POPLAR is the first approach to incorporate graph Laplacians constraints using auxiliary information. We extensively evaluate \method's performance in comparison to state-of-the-art approaches across synthetic and real datasets and POPLAR clearly exhibits better performance with respect to the Fitness (better 3-8%), and F1 score (better 5-20%) among the state-of-the-art factorization method. Furthermore, the running time for the method is comparable to the state-of-art method.
Keywords
PARAFAC2 Decomposition; Tensor
Speaker
Ekta Gujral
University of California, Riverside, USA

Submission Author
Ekta Gujral University of California, Riverside, USA
Georgios Theocharous Adobe Inc, USA
Evangelos Papalexakis University of California Riverside, USA
Comment submit
Verification code Change another
All comments
Log in Sign up Registration Submit