Predicting the popularity growth of online content: Model and algorithm

被引:25
作者
Lymperopoulos, Ilias N. [1 ]
机构
[1] Athens Univ Econ & Business, Dept Management Sci & Technol, 47a Evelpidon Str, Athens 11362, Greece
关键词
Popularity prediction; Information diffusion; Information cascade; Social network; Online content adoption; Popularity growth model;
D O I
10.1016/j.ins.2016.07.043
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The evolution of the popularity of online content is analyzed; and two characteristic patterns pertaining to linear and non-linear growth periods are detected. While the former characterizes the propagation of online content through a dynamical process in a state of statistical equilibrium, the latter appears when this state is perturbed by exogenous intervention events. Such episodes increase the susceptibility of higher threshold individuals who opportunistically adopt the propagating content. To capture the dynamics of both diffusion modes, the popularity of online content is modeled by interlacing linear and non-linear growth terms, reduced to lst-degree polynomial and logistic functions corresponding respectively to stationary and non-stationary adoption phases. The precise fit of the model to empirical popularity patterns verifies its suitability as prediction tool. The proposed model is employed to generate forecasts about the popularity of online content through extrapolation. Highly accurate prediction results surpassing existing methods in terms of precision and predictive capacity are demonstrated. The prediction method is formulated into an algorithm, applicable to real time forecasting of the popularity of online content without training, using minimal, macroscopic, publicly available information. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:585 / 613
页数:29
相关论文
共 49 条
[1]  
Ahmed M., 2013, P 6 ACM INT C WEB SE, P607, DOI [10.1145/2433396.2433473, DOI 10.1145/2433396.2433473]
[2]  
[Anonymous], 2012, 18 ACM SIGKDD INT C, DOI DOI 10.1145/2339530.2339537
[3]  
[Anonymous], 2012, P 6 INT AAAI C WEBL
[4]  
[Anonymous], 2009, Proceedings of the 18th AC M conference on Inform ation and knowledge management, DOI 10.1145/1645953.1646225
[5]  
[Anonymous], 2002, MATH BIOL
[6]  
[Anonymous], Proceedings of the 21st ACM international conference on Information and knowledge management, DOI DOI 10.1145/2396761.2398634
[7]  
[Anonymous], Proceedings of the fifth ACMinternational conference on Web search and data mining, DOI [DOI 10.1145/2124295.2124320, 10.1145/2124295.2124320]
[8]  
[Anonymous], 2011, P ACM INT C WEB SEAR, DOI DOI 10.1145/1935826.1935863
[9]  
[Anonymous], 2010, Proceedings of the 19th International Conference on World Wide Web, WWW'10, page, DOI DOI 10.1145/1772690.1772754
[10]  
[Anonymous], 2009, WWW 09 P 18 INT WORL, DOI DOI 10.1145/1526709.1526806