期刊
NEURAL COMPUTING & APPLICATIONS
卷 32, 期 11, 页码 6913-6923出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00521-019-04161-5
关键词
Online social network; Causal discovery; Transfer entropy; Non-redundant causal relationships
资金
- NSFC-Guangdong Joint Found [U1501254]
- Natural Science Foundation of China [61472089]
- Natural Science Foundation of Guangdong [2014A030306004, 2014A030308008]
- Science and Technology Planning Project of Guangdong [2015B010108006, 2015B010131015, 2015B010129014]
- Guangdong High-level personnel of special support program [2015TQ01X140]
- Pearl River S&T Nova Program of Guangzhou [201610010101]
- Science and Technology Planning Project of Guangzhou [201604016075]
Causal discovery is crucial to obtain a deep understanding of the actual mechanism behind the online social network, e.g., identifying the influential individuals and understanding the interaction among user behavior sequences. However, detecting causal directions and pruning causal redundancy of online social networks are still the great challenge of existing research. This paper proposed a constraint-based approach, minimal causal network (MCN), to mine hidden non-redundant causal relationships behind user behavior sequences. Under the MCN, the transfer entropy with the adaptive causal time lag is used to detect causal directions and find causal time lags, while a permutation-based significance test is proposed to prune redundant edges. Experiments on simulated data verify the effectiveness of our proposed method. We also apply our approach to real-world data from Sina Weibo and reveal some interesting discoveries.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据