Mining Influential Who-to-Post and When-to-Post Curators on Social Networks

被引:0
作者
Hsia, Chieh-Cheng [1 ]
Li, Cheng-Te [1 ]
机构
[1] Natl Cheng Kung Univ, Inst Data Sci, Dept Stat, Tainan 701, Taiwan
关键词
social network analysis; feature engineering; influence prediction; node embedding; when-to-post scheduling;
D O I
10.6688/JISE.202107_37(4).0012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Curators on the social networking sites become prominent and indispensable nowadays. Gradually, they come to be the voice in the business's online marketing field. The problem that how to find the most future-influential curators and plan the best posting time for them, notwithstanding, has been hidden and under-explored as yet. In this study, we initiate to analyze this problem with those two primary concerns from four distinct dimensions. To find the most future-influential curators, we consider this problem from the following two dimensions, Future Influence Ranking Prediction and Future Influential Leader Prediction. To plan the best posting time for the curators, similarly, we consider this part with two dimensions below, Accumulated Influence Post-time Scheduling and Limited Influence Post-time Scheduling. We aim at predicting the future influential curator with a series of basic and advanced self-defined features. Based on network embedding, we add learned features to capture the connection between users. To deal with the problem, we implement Learning-to-Rank algorithm and two newly devised ones, self-training algorithm and mutual-training algorithm, which are served to become the solution to the imbalanced data. With the experiments on large-scale Facebook data, we find the proposed methods significantly outperform the conventional prediction settings. The F1 score in predicting the most future influential curators can be up to 0.875. Also, in the part of planning the best posting time, the result shows in comparison with the overall performance of curators, the limited influence of the curators in our planned time can be boosted up to three times.
引用
收藏
页码:935 / 958
页数:24
相关论文
共 35 条
  • [1] Agarwal N, 2008, P INT C WEB SEARCH W, P207
  • [2] [Anonymous], 2008, P 17 ACM C INF KNOWL, DOI [DOI 10.1145/1458082.1458149, 10.1145/1458082.1458149]
  • [3] [Anonymous], 2010, MSRTR201082 MICR RES
  • [4] Bakshy E., 2011, Everyone's an Influencer: Quantifying Influence on Twitter, P65, DOI DOI 10.1145/1935826.1935845
  • [5] Bernstein M. S., 2013, P SIGCHI C HUM FACT, V3, P21, DOI [10.1145/2470654.2470658, DOI 10.1145/2470654.2470658]
  • [6] Bhagat S, 2012, P 5 ACM INT C WEB SE, P603, DOI DOI 10.1145/2124295.2124368
  • [7] Cha M., 2009, P 18 INT C WORLD WID, DOI [DOI 10.1145/1526709.1526806, 10.1145/1526709.1526806]
  • [8] Efficient Influence Maximization in Social Networks
    Chen, Wei
    Wang, Yajun
    Yang, Siyu
    [J]. KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, : 199 - 207
  • [9] Can Cascades be Predicted?
    Cheng, Justin
    Adamic, Lada A.
    Dow, P. Alex
    Kleinberg, Jon
    Leskovec, Jure
    [J]. WWW'14: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2014, : 925 - 935
  • [10] Cui P, 2011, PROCEEDINGS OF THE 34TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR'11), P185