.png){kind=icon}
.png){kind=icon}
Return
Graph regularized Bayesian tensor factorization based on Kronecker-Decomposable dictionary
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2021.106968.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The tensor factorization techniques preserve the intrinsic structure information better than the matrix factorization technique. However, the outliers on each mode are usually non-independent and identically distributed (non-i.i.d) and the incoherence is non-uniform. The existing matrix factorization methods cannot deal with the non-i.i.d outliers and the non-uniform incoherence well. Although Kronecker-Decomposable sparse dictionary learning (KDSDL) model has shown effectiveness in dealing with the non-uniform incoherence, the non-i.i.d outliers and the correlation between different mode are still not considered. To address these problems, we propose a graph regularized Bayesian tensor factorization based on KDSDL model. First, to consider the non-i.i.d noise in real scenario, we embed the mixture of outliers in each mode through KDSDL model; Second, to capture the correlation between different modes, a novel graph sparsity-inducing regularization is proposed. The experiments on tensor data with complex outliers demonstrate the superiority of the proposed methods over the existing state-of-the-art methods.
Keywords:
Bayesian tensor factorization
Kronecker-Decomposition
Dictionary learning
Graph sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
No organization information available