Kernel-Based Structural-Temporal Cascade Learning for Popularity Prediction

Ce Li, Fan Zhou, Xucheng Luo, Goce Trajcevski
{"title":"Kernel-Based Structural-Temporal Cascade Learning for Popularity Prediction","authors":"Ce Li, Fan Zhou, Xucheng Luo, Goce Trajcevski","doi":"10.1109/GLOBECOM46510.2021.9685636","DOIUrl":null,"url":null,"abstract":"One of the main objectives of information cascade popularity prediction is to forecast the future size of a cascade given the observed propagation information. It is an enabling step for many practical applications (e.g., advertisement, academic writing, etc.). Recent advances in neural networks have spurred a few deep learning-based cascade models, which preserve the structural features of information cascades with node embedding and graph neural networks. However, efforts in cascade graph learning as well as its internal temporal dependency, existing methods mainly focus on node-level similarity learning, ignoring the structural equivalence among different sub-graphs that are more informative for information diffusion prediction. Towards this, we present a kernel-based structural-temporal cascade learning model, called CasKernel, to explicitly estimate and encode the structural similarity of cascades with the graph kernels. Moreover, we employ a non sequential process to address the temporal dependency, which can be used to facilitate information popularity prediction. Experiments conducted on both tweets propagation network and academic citation network demonstrate the effectiveness of our method.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"183 2 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 Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM46510.2021.9685636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

One of the main objectives of information cascade popularity prediction is to forecast the future size of a cascade given the observed propagation information. It is an enabling step for many practical applications (e.g., advertisement, academic writing, etc.). Recent advances in neural networks have spurred a few deep learning-based cascade models, which preserve the structural features of information cascades with node embedding and graph neural networks. However, efforts in cascade graph learning as well as its internal temporal dependency, existing methods mainly focus on node-level similarity learning, ignoring the structural equivalence among different sub-graphs that are more informative for information diffusion prediction. Towards this, we present a kernel-based structural-temporal cascade learning model, called CasKernel, to explicitly estimate and encode the structural similarity of cascades with the graph kernels. Moreover, we employ a non sequential process to address the temporal dependency, which can be used to facilitate information popularity prediction. Experiments conducted on both tweets propagation network and academic citation network demonstrate the effectiveness of our method.
基于核的结构-时间级联学习的人气预测
信息级联流行度预测的主要目标之一是在给定观察到的传播信息的情况下预测级联未来的大小。这对于许多实际应用(例如,广告,学术写作等)是一个有利的步骤。神经网络的最新进展催生了一些基于深度学习的级联模型,这些模型通过节点嵌入和图神经网络保留了信息级联的结构特征。然而,在级联图学习及其内在的时间依赖性方面,现有的方法主要集中在节点级的相似学习上,忽略了不同子图之间的结构等价性,而这对信息扩散预测更有帮助。为此,我们提出了一种基于核的结构-时间级联学习模型,称为CasKernel,用于用图核显式估计和编码级联的结构相似性。此外,我们采用非顺序过程来解决时间依赖性,这可以用来促进信息流行度的预测。在推文传播网络和学术引文网络上进行的实验证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信