Identifying Top-k Nodes in Social Networks: A Survey

被引:35
|
作者
Bian, Ranran [1 ,2 ]
Koh, Yun Sing [1 ]
Dobbie, Gillian [1 ]
Divoli, Anna [2 ]
机构
[1] Univ Auckland, Sch Comp Sci, Auckland, New Zealand
[2] Pingar, Auckland, New Zealand
关键词
Top-k nodes identification; social network graphs; INFLUENTIAL NODES; INFLUENCE MAXIMIZATION; CENTRALITY; DIFFUSION; POWER;
D O I
10.1145/3301286
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Top-k nodes are the important actors for a subjectively determined topic in a social network. To some extent, a topic is taken as a ranking criteria for identifying top-k nodes. Within a viral marketing network, subjectively selected topics can include the following: Who can promote a new product to the largest number of people, and who are the highest spending customers? Based on these questions, there has been a growing interest in top-k nodes research to effectively identify key players. In this article, we review and classify existing literature on top-k nodes identification into two major categories: top-k influential nodes and top-k significant nodes. We survey both theoretical and applied work in the field and describe promising research directions based on our review. This research area has proven to be beneficial for data analysis on online social networks as well as practical applications on real-life networks.
引用
收藏
页数:33
相关论文
共 50 条
  • [1] Identifying Top-K Influential Nodes in Networks
    Mumtaz, Sara
    Wang, Xiaoyang
    [J]. CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 2219 - 2222
  • [2] Identifying the Top-k Influential Spreaders in Social Networks: a Survey and Experimental Evaluation
    Taha, Kamal
    [J]. IEEE ACCESS, 2022, 10 : 107809 - 107845
  • [3] Top-K Influential Nodes in Social Networks: A Game Perspective
    Zhang, Yu
    Zhang, Yan
    [J]. SIGIR'17: PROCEEDINGS OF THE 40TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2017, : 1029 - 1032
  • [4] Estimating Top-k Betweenness Centrality Nodes in Online Social Networks
    Nakajima, Kazuki
    Iwasaki, Kenta
    Matsumura, Toshiki
    Shudo, Kazuyuki
    [J]. 2018 IEEE INT CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, UBIQUITOUS COMPUTING & COMMUNICATIONS, BIG DATA & CLOUD COMPUTING, SOCIAL COMPUTING & NETWORKING, SUSTAINABLE COMPUTING & COMMUNICATIONS, 2018, : 1128 - 1135
  • [5] Detection of Top-K Central Nodes in Social Networks: A Compressive Sensing Approach
    Mahyar, Hamidreza
    [J]. PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), 2015, : 902 - 909
  • [6] IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks
    Beni, Hamid Ahmadi
    Aghaee, Zahra
    Bouyer, Asgarali
    Vahidipour, Mehdi
    [J]. 2020 6TH INTERNATIONAL CONFERENCE ON WEB RESEARCH (ICWR), 2020, : 84 - 88
  • [7] Preference-based Top-K Influential Nodes Mining in Social Networks
    Zhang, Yunlong
    Zhou, Jingyu
    Cheng, Jia
    [J]. TRUSTCOM 2011: 2011 INTERNATIONAL JOINT CONFERENCE OF IEEE TRUSTCOM-11/IEEE ICESS-11/FCST-11, 2011, : 1512 - 1518
  • [8] Preference-based mining of top-K influential nodes in social networks
    Zhou, Jingyu
    Zhang, Yunlong
    Cheng, Jia
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2014, 31 : 40 - 47
  • [9] A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks
    Han, Lihong
    Li, Kuan-Ching
    Castiglione, Arcangelo
    Tang, Jianxin
    Huang, Hengjun
    Zhou, Qingguo
    [J]. SOFT COMPUTING, 2021, 25 (13) : 8223 - 8240
  • [10] A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks
    Lihong Han
    Kuan-Ching Li
    Arcangelo Castiglione
    Jianxin Tang
    Hengjun Huang
    Qingguo Zhou
    [J]. Soft Computing, 2021, 25 : 8223 - 8240