Papers › Information Diffusion Prediction with Latent Factor Disentanglement

Information Diffusion Prediction with Latent Factor Disentanglement

16 Dec 2020arXiv:2012.08828links table onlyarchive 2025-07-28

Haoran Wang, Cheng Yang

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Information diffusion prediction is a fundamental task which forecasts how an information item will spread among users. In recent years, deep learning based methods, especially those based on recurrent neural networks (RNNs), have achieved promising results on this task by treating infected users as sequential data. However, existing methods represent all previously infected users by a single vector and could fail to encode all necessary information for future predictions due to the mode collapse problem. To address this problem, we propose to employ the idea of disentangled representation learning, which aims to extract multiple latent factors representing different aspects of the data, for modeling the information diffusion process. Specifically, we employ a sequential attention module and a disentangled attention module to better aggregate the history information and disentangle the latent factors. Experimental results on three real-world datasets show that the proposed model SIDDA significantly outperforms state-of-the-art baseline methods by up to 14% in terms of hits@N metric, which demonstrates the effectiveness of our method.

PaperPDFCode

Code

buptwhr/SIDDA mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections