Predicting the Popularity of News Based on Competitive Matrix

被引:1
作者
Wang, Xiaomeng [1 ]
Fang, Binxing [1 ]
Zhang, Hongli [1 ]
Yu, Xuan [1 ]
机构
[1] Harbin Inst Technol, Harbin, Heilongjiang, Peoples R China
来源
2017 IEEE SECOND INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC) | 2017年
关键词
diffusion; competitive matrix; popularity; social network;
D O I
10.1109/DSC.2017.88
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development of network, more and more people share and comment on the web to express their mends. How to predict the popularity of topic happening recently is a hot topic and lots of people are trying to find out the law of information diffusion hidden in it. However, many models assume that information spreads with no external interference in social networks. The research on competitive diffusion is still at the primary stage. The main contribution is to solve the problem that there are few or no work for popularity prediction based on multi-information, and propose a predicting model based on competitive matrix. The goal of this paper is to accurately estimate the popularity for a given viral topic at final based on the observation of historical popularity of the topic. And this model is mainly based on the competitive matrix and gradient descent method. Also, the capability of this method provides a better performance in the popularity prediction according to an empirical study on Tencent News.
引用
收藏
页码:151 / 155
页数:5
相关论文
共 16 条
  • [1] [Anonymous], 2012, 18 ACM SIGKDD INT C, DOI DOI 10.1145/2339530.2339537
  • [2] [Anonymous], SCI REPORTS
  • [3] [Anonymous], 2003, PROC ACM SIGKDD INT
  • [4] [Anonymous], 2012, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, DOI DOI 10.1145/2339530.2339601
  • [5] Bao P, 2013, PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'13 COMPANION), P177
  • [6] CSI: Charged System Influence Model for Human Behavior Prediction
    Bi, Yuanjun
    Wu, Weili
    Zhu, Yuqing
    [J]. 2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2013, : 31 - 40
  • [7] Greedy function approximation: A gradient boosting machine
    Friedman, JH
    [J]. ANNALS OF STATISTICS, 2001, 29 (05) : 1189 - 1232
  • [8] Community structure in social and biological networks
    Girvan, M
    Newman, MEJ
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (12) : 7821 - 7826
  • [9] Talk of the network: A complex systems look at the underlying process of word-of-mouth
    Goldenberg, J
    Libai, B
    Muller, E
    [J]. MARKETING LETTERS, 2001, 12 (03) : 211 - 223
  • [10] Predicting the popularity of viral topics based on time series forecasting
    Hu, Ying
    Hu, Changjun
    Fu, Shushen
    Shi, Peng
    Ning, Bowen
    [J]. NEUROCOMPUTING, 2016, 210 : 55 - 65