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 条
  • [31] Tang J, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P807
  • [32] Influence Maximization in Near-Linear Time: A Martingale Approach
    Tang, Youze
    Shi, Yanchen
    Xiao, Xiaokui
    [J]. SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 1539 - 1554
  • [33] Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency
    Tang, Youze
    Xiao, Xiaokui
    Shi, Yanchen
    [J]. SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2014, : 75 - 86
  • [34] RedQueen: An Online Algorithm for Smart Broadcasting in Social Networks
    Zarezade, Ali
    Upadhyay, Utkarsh
    Rabiee, Hamid R.
    Gomez-Rodriguez, Manuel
    [J]. WSDM'17: PROCEEDINGS OF THE TENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2017, : 51 - 60
  • [35] Zhang C., 2012, Proceedings of the 21st ACM interna- tional conference on Information and knowledge management, P1442, DOI [10.1145/2396761.2398450, DOI 10.1145/2396761.2398450]