Identifying Influential Nodes Using a Shell-Based Ranking and Filtering Method in Social Networks
Author:
Affiliation:
1. Department of Computer Engineering, Azarbaijan Shahid Madani University, Tabriz, Iran.
Publisher
Mary Ann Liebert Inc
Subject
Information Systems and Management,Computer Science Applications,Information Systems
Link
https://www.liebertpub.com/doi/pdf/10.1089/big.2020.0259
Reference55 articles.
1. Efficient influence maximization in social networks
2. TSIM: A Two-Stage Selection Algorithm for Influence Maximization in Social Networks
3. Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
4. Information and Influence Propagation in Social Networks
5. 5. Goyal A, Lu W, Lakshmanan LV. SIMPATH: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining. Vancouver, Canada: IEEE, 2011. pp. 211–220.
Cited by 23 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers;Journal of King Saud University - Computer and Information Sciences;2024-10
2. A hybrid dynamic memetic algorithm for the influence maximization problem in social networks;International Journal of Modern Physics C;2024-08-17
3. Time and cost-effective online advertising in social Internet of Things using influence maximization problem;Wireless Networks;2023-10-04
4. Identifying influential nodes based on new layer metrics and layer weighting in multiplex networks;Knowledge and Information Systems;2023-09-24
5. A fast module identification and filtering approach for influence maximization problem in social networks;Information Sciences;2023-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3