当前位置: X-MOL 学术Inform. Sci. › 论文详情
Efficient Algorithms based on Centrality Measures for Identification of Top-K Influential Users in Social Networks
Information Sciences ( IF 5.524 ) Pub Date : 2020-03-26 , DOI: 10.1016/j.ins.2020.03.060
Mohammed Alshahrani; Zhu Fuxi; Ahmed Sameh; Soufiana Mekouar; Sheng Huang

The problem of influence maximization has grown in popularity and interest in recent decades due to its valuable application in various fields. This problem mainly focuses on identifying Top-K influential users that, when selected, the influence spread will be maximized. Thus, the identification of such nodes is pivotal in increasing the adoption of promoted information and behavior within the network. In this paper, we propose two new efficient algorithms, namely, ”MinCDegKatz d-hops (MaxCDegKatz d-hops)” that relies on a combination of centralization measures due to their known efficiency and performance in terms of influence spread and their low runtime complexity. The proposed algorithms combine between the degree centrality as local measure and the Katz centrality as global centrality metric on a graph with preselected weight edges that should exceed a predefined threshold value. Thus, each selected seed set is separated by a number of hops that differ depending on the graph radius. Then, the influence spread is measured for the two proposed algorithms under the Independent Cascade (IC) and Linear Threshold (LT) models. We conducted extensive experiments on a large-scale graph that demonstrated the performance of our proposed algorithms against existing approaches in term of spreading ability and time complexity.
更新日期:2020-03-27

 

全部期刊列表>>
智控未来
聚焦商业经济政治法律
跟Nature、Science文章学绘图
控制与机器人
招募海内外科研人才,上自然官网
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
湖南大学化学化工学院刘松
上海有机所
李旸
南方科技大学
西湖大学
X-MOL
支志明
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug