Leveraging adaptive peeking window to improve self-exciting point process model for popularity prediction

Zemin Bao, Yun Liu, Hui Liu, Zhenjiang Zhang, Bo Shen, Junjun Cheng
{"title":"Leveraging adaptive peeking window to improve self-exciting point process model for popularity prediction","authors":"Zemin Bao, Yun Liu, Hui Liu, Zhenjiang Zhang, Bo Shen, Junjun Cheng","doi":"10.1109/BESC.2017.8256373","DOIUrl":null,"url":null,"abstract":"Predicting the popularity of online content is an important issue. The mainstream method is to model the cumulative growth of the popularity as a temporal point process and to make predictions based on the observed initial period of information cascade. The peeking window, which will be taken into consideration in making predictions, is vitally important for the accuracy of predictions. However, the existing studies only generated hypotheses about the initial burst and maintained a consistent size of the peeking window for all content. The limited accuracy of previous approaches raises a fundamental question, i.e., How can we obtain the most effective part of the history to make an accurate prediction? In this paper, we identified the existence of a strong correlation between the peeking window and the temporal dynamic of the instantaneous relative attractiveness for a given online content. An investigation was conducted to explore the adaptive peeking window, which was used in a selfexciting point process model to predict eventual future popularity. Empirical studies on a Twitter dataset demonstrated that the proposed method significantly outperformed existing approaches.","PeriodicalId":142098,"journal":{"name":"2017 International Conference on Behavioral, Economic, Socio-cultural Computing (BESC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Behavioral, Economic, Socio-cultural Computing (BESC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BESC.2017.8256373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Predicting the popularity of online content is an important issue. The mainstream method is to model the cumulative growth of the popularity as a temporal point process and to make predictions based on the observed initial period of information cascade. The peeking window, which will be taken into consideration in making predictions, is vitally important for the accuracy of predictions. However, the existing studies only generated hypotheses about the initial burst and maintained a consistent size of the peeking window for all content. The limited accuracy of previous approaches raises a fundamental question, i.e., How can we obtain the most effective part of the history to make an accurate prediction? In this paper, we identified the existence of a strong correlation between the peeking window and the temporal dynamic of the instantaneous relative attractiveness for a given online content. An investigation was conducted to explore the adaptive peeking window, which was used in a selfexciting point process model to predict eventual future popularity. Empirical studies on a Twitter dataset demonstrated that the proposed method significantly outperformed existing approaches.
利用自适应窥视窗改进自激点过程模型进行人气预测
预测在线内容的受欢迎程度是一个重要的问题。主流的方法是将人气的累积增长建模为一个时间点过程,并根据观察到的信息级联初始期进行预测。窥视窗口对于预测的准确性至关重要,它将在预测中被考虑在内。然而,现有的研究只产生了关于初始爆发的假设,并为所有内容保持了一致的窥视窗口大小。以前的方法的有限的准确性提出了一个基本的问题,即,我们如何才能获得历史的最有效的部分,以作出准确的预测?在本文中,我们确定了窥视窗口与给定在线内容的瞬时相对吸引力的时间动态之间存在很强的相关性。研究了自适应窥视窗,并将其应用于自激点过程模型来预测未来的流行程度。对Twitter数据集的实证研究表明,该方法显著优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信