Efficient algorithms based on centrality measures for identification of top-K influential users in social networks-Reference-Cited by-同舟云学术

Efficient algorithms based on centrality measures for identification of top-K influential users in social networks

Published:2020-07 Issue: Volume:527 Page:88-107
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Alshahrani Mohammed,Fuxi Zhu,Sameh Ahmed,Mekouar Soufiana^ORCID,Huang Sheng

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference38 articles.

1. Top-k influential users selection based on combined katz centrality and propagation probability;Alshahrani,2018

2. Efficient methods to select top-k propagators based on distance and radius neighbor;Alshahrani,2018

3. Total communicability as a centrality measure;Benzi;J. Complex Netw.,2013

4. Competitive influence maximization in social networks;Bharathi,2007

5. Network analysis in the social sciences;Borgatti;Science,2009

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Influence maximization for heterogeneous networks based on self-supervised clustered heterogeneous graph transformer;Pattern Recognition;2024-10

2. Opinion Leader Detection in Online Social Networks Based on Output and Input Links;Wireless Personal Communications;2024-09-12

3. Measuring the centrality of nodes in networks based on the interstellar model;Information Sciences;2024-09

4. Estimating the Expected Influence Capacities of Nodes in Complex Networks under the Susceptible-Infectious-Recovered Model;Bitlis Eren Üniversitesi Fen Bilimleri Dergisi;2024-06-29

5. Identifying influential users using homophily-based approach in location-based social networks;The Journal of Supercomputing;2024-05-25