MC-RGCN: A Multi-Channel Recurrent Graph Convolutional Network to Learn High-Order Social Relations for Diffusion Prediction

Ningbo Huang, Gang Zhou, Mengli Zhang, Mengli Zhang
{"title":"MC-RGCN: A Multi-Channel Recurrent Graph Convolutional Network to Learn High-Order Social Relations for Diffusion Prediction","authors":"Ningbo Huang, Gang Zhou, Mengli Zhang, Mengli Zhang","doi":"10.1109/ICDM51629.2021.00130","DOIUrl":null,"url":null,"abstract":"Information diffusion prediction aims to predict the tendency of information spreading in the network. Previous methods focus on extracting chronological features from diffusion paths and leverage relations in social graph as side information to facilitate diffusion prediction. However, abundant high-order social relations in information diffusion have not been sufficiently utilized, such as co-repose and co-following which can further mine potential user common preferences. In this paper, we construct a heterogeneous diffusion network (HDN) from the social graph and information cascades to model the high-order social relations in information diffusion. Then, we design a novel model named Multi-Channel Recurrent Graph Convolutional Network (MC-RGCN), which can extract high-order social relation semantics from the channels of HDN to promote prediction performance. In each channel, we depict a specific social relations from the views of global topology, pairwise strength, and local structure. Finally, we conduct extensive experiments on three real-world datasets, and the results show that our proposed method outperforms the state-of-the-art models on diffusion prediction.","PeriodicalId":320970,"journal":{"name":"2021 IEEE International Conference on Data Mining (ICDM)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Data Mining (ICDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM51629.2021.00130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Information diffusion prediction aims to predict the tendency of information spreading in the network. Previous methods focus on extracting chronological features from diffusion paths and leverage relations in social graph as side information to facilitate diffusion prediction. However, abundant high-order social relations in information diffusion have not been sufficiently utilized, such as co-repose and co-following which can further mine potential user common preferences. In this paper, we construct a heterogeneous diffusion network (HDN) from the social graph and information cascades to model the high-order social relations in information diffusion. Then, we design a novel model named Multi-Channel Recurrent Graph Convolutional Network (MC-RGCN), which can extract high-order social relation semantics from the channels of HDN to promote prediction performance. In each channel, we depict a specific social relations from the views of global topology, pairwise strength, and local structure. Finally, we conduct extensive experiments on three real-world datasets, and the results show that our proposed method outperforms the state-of-the-art models on diffusion prediction.
MC-RGCN:一种学习高阶社会关系的多通道循环图卷积网络
信息扩散预测的目的是预测信息在网络中的传播趋势。以往的方法侧重于从扩散路径中提取时间特征,并利用社交图中的关系作为侧信息来促进扩散预测。然而,信息传播中丰富的高阶社会关系没有得到充分利用,如共同休息和共同追随,这些关系可以进一步挖掘潜在用户的共同偏好。本文利用社会图谱和信息级联构建了一个异构扩散网络(HDN)来模拟信息扩散中的高阶社会关系。然后,我们设计了一种新的多通道递归图卷积网络模型(MC-RGCN),该模型可以从HDN的通道中提取高阶社会关系语义,以提高预测性能。在每个通道中,我们从全局拓扑、成对强度和局部结构的角度描述了特定的社会关系。最后,我们在三个真实世界的数据集上进行了广泛的实验,结果表明我们提出的方法在扩散预测方面优于最先进的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信