.png){kind=icon}
Return
Algorithms for probabilistic latent tensor factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2011.09.033.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a general probabilistic framework for modelling multiway data. Our approach establishes a novel link between graphical representation of probability measures and tensor factorization models that allow us to design arbitrary tensor factorization models while retaining simplicity. Using an expectation-maximization (EM) approach for maximizing the likelihood of the exponential dispersion models (EDM), we obtain iterative update equations for Kullback-Leibler (KL), Euclidian (EU) or Itakura-Saito (IS) costs as special cases. Besides EM, we derive alternative algorithms with multiplicative update rules (MUR) and alternating projections. We also provide algorithms for MAP estimation with conjugate priors. All of the algorithms can be formulated as message passing algorithm on a graph where vertices correspond to indices and cliques represent factors of the tensor decomposition. (c) 2011 Elsevier B.V. All rights reserved.
Keywords:
Tensor factorization
beta-Divergence
Exponential dispersion models
EM algorithm
Multiplicative update rules
Matricization
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
Imine-linked micron-network polymers with high polyethylene glycol uptake for shaped-stabilized phase change materials.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more