A Novel Greedy FluidSpread Algorithm With Equilibrium Temperature for Influence Diffusion in Social Networks

被引:1
|
作者
Toalombo, Marcelo [1 ]
Wang, Bang [1 ]
Xu, Han [2 ]
Xu, Minghua [2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Journalism & Informat Commun, Wuhan 430074, Peoples R China
来源
IEEE SYSTEMS JOURNAL | 2021年 / 15卷 / 02期
关键词
FluidSpread; fluid dynamics; influence diffusion; influencemaximization; information diffusion; maximizing positive influenced users (MPIU); social networks; INFLUENCE MAXIMIZATION; POSITIVE INFLUENCE; SPREAD; USERS;
D O I
10.1109/JSYST.2020.3007376
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Maximizing positive influenced users (MPIU) is one of the most important and classic problems in social networks. In this article, we propose an effective solution to the problem of MPIU with positive top-k influence, namely, Greedy FluidSpread Algorithm with Equilibrium Temperature (GFAET). In this article, the behavior of the users, such as the interactions and relationships of each user, and the content of a topic aremodeled to the user interest vector and the topic distribution vector, respectively, to calculate the information acceptance probability. The influence diffusion process in social network is modeled as a fluid dynamics system and the attitude of the user is modeled as the fluid temperature. Newton's law of cooling and fluid dynamics theory is utilized to obtain amore accurate value of equilibrium temperature. Important users are then greedily selected in this system. Extensive experiments demonstrate that our GFAET significantly outperforms other traditional methods in terms of positive influence spread on both artificially generated and real-trace network datasets.
引用
收藏
页码:3057 / 3068
页数:12
相关论文
共 50 条
  • [41] Fair Influence Maximization in Social Networks: A Community-Based Evolutionary Algorithm
    Ma, Kaicong
    Xu, Xinxiang
    Yang, Haipeng
    Cao, Renzhi
    Zhang, Lei
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2025, 13 (01) : 262 - 275
  • [42] Influence Maximization in social networks using discretized Harris' Hawks Optimization algorithm
    Khatri, Inder
    Choudhry, Arjun
    Rao, Aryaman
    Tyagi, Aryan
    Vishwakarma, Dinesh Kumar
    Prasad, Mukesh
    APPLIED SOFT COMPUTING, 2023, 149
  • [43] A Linear Time Algorithm for Influence Maximization in Large-Scale Social Networks
    Wu, Hongchun
    Shang, Jiaxing
    Zhou, Shangbo
    Feng, Yong
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT V, 2017, 10638 : 752 - 761
  • [44] A Multi-Objective Crow Search Algorithm for Influence Maximization in Social Networks
    Wang, Ping
    Zhang, Ruisheng
    ELECTRONICS, 2023, 12 (08)
  • [45] Efficient influence maximization under TSCM: a suitable diffusion model in online social networks
    Qin, Yadong
    Ma, Jun
    Gao, Shuai
    SOFT COMPUTING, 2017, 21 (04) : 827 - 838
  • [46] Efficient influence maximization under TSCM: a suitable diffusion model in online social networks
    Yadong Qin
    Jun Ma
    Shuai Gao
    Soft Computing, 2017, 21 : 827 - 838
  • [47] Influence Diffusion in Online Social Networks With Propagation Rate Changes
    Pan, Tianyi
    Li, Xiang
    Kuhnle, Alan
    Thai, My T.
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (04): : 3100 - 3111
  • [48] An Upper Bound based Greedy Algorithm for Mining Top-k Influential Nodes in Social Networks
    Zhou, Chuan
    Zhang, Peng
    Guo, Jing
    Guo, Li
    WWW'14 COMPANION: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2014, : 421 - 422
  • [49] A Novel Triangle Count-Based Influence Maximization Method on Social Networks
    Chandran, Jyothimon
    Viswanatham, Madhu V.
    INTERNATIONAL JOURNAL OF KNOWLEDGE AND SYSTEMS SCIENCE, 2021, 12 (04)
  • [50] Influence maximization algorithm based on cross propagation in location-based social networks
    Zhang, Zhen
    Zhang, Zhenyu
    Wu, Xiaohong
    WIRELESS NETWORKS, 2020, 26 (07) : 5035 - 5046