.png){kind=icon}
返回
Time-aware tensor decomposition for sparse tensors
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-021-06059-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a sparse time-evolving tensor, how can we effectively factorize it to accurately discover latent patterns? Tensor decomposition has been extensively utilized for analyzing various multi-dimensional real-world data. However, existing tensor decomposition models have disregarded the temporal property for tensor decomposition while most real-world data are closely related to time. Moreover, they do not address accuracy degradation due to the sparsity of time slices. The essential problems of how to exploit the temporal property for tensor decomposition and consider the sparsity of time slices remain unresolved. In this paper, we propose time-aware tensor decomposition (tatd), an accurate tensor decomposition method for sparse temporal tensors. tatd is designed to exploit time dependency and time-varying sparsity of real-world temporal tensors. We propose a new smoothing regularization with Gaussian kernel for modeling time dependency. Moreover, we improve the performance of tatd by considering time-varying sparsity. We design an alternating optimization scheme suitable for temporal tensor decomposition with our smoothing regularization. Extensive experiments show that tatd provides the state-of-the-art accuracy for decomposing temporal tensors.
Keyword:
Temporal tensor
Time-aware tensor decomposition
Time dependency
Kernel smoothing regularization
Time-varying sparsity
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
.png){kind=icon}
Cellular Dynamic Simulator: An Event Driven Molecular Simulation Environment for Cellular Physiology
OAAI
OAAI分享收藏分享收藏
查看更多内容