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 条
  • [1] SMG: Fast scalable greedy algorithm for influence maximization in social networks
    Heidari, Mehdi
    Asadpour, Masoud
    Faili, Hesham
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 420 : 124 - 133
  • [2] Mixed heuristic and greedy strategies based algorithm for influence maximization in social networks
    Cao J.
    Min H.
    Xu S.
    Liu B.
    Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition), 2016, 46 (05): : 950 - 956
  • [3] Fluidspread: A New Method of Maximizing Positive Influence in Online Social Networks via Fluid Dynamics
    Wang, Feng
    She, Jinhua
    Ohyama, Yasuhiro
    Wu, Min
    2020 IEEE 16TH INTERNATIONAL CONFERENCE ON CONTROL & AUTOMATION (ICCA), 2020, : 1600 - 1604
  • [4] Diffusion Models and Approaches for Influence Maximization in Social Networks
    Tejaswi, V.
    Bindu, P. V.
    Thilagam, P. Santhi
    2016 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2016, : 1345 - 1351
  • [5] Modeling Influence Diffusion over Signed Social Networks
    Li, Dong
    Liu, Jiming
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (02) : 613 - 625
  • [6] Fuzzy sign-aware diffusion models for influence maximization in signed social networks
    Mohammadi, Sohameh
    Nadimi-Shahraki, Mohammad H.
    Beheshti, Zahra
    Zamanifar, Kamran
    INFORMATION SCIENCES, 2023, 645
  • [7] A survey on information diffusion and competitive influence maximization in social networks
    Shano Solanki
    Mukesh Kumar
    Rakesh Kumar
    Social Network Analysis and Mining, 15 (1)
  • [8] Efficient Greedy Algorithms for Influence Maximization in Social Networks
    Lv, Jiaguo
    Guo, Jingfeng
    Ren, Huixiao
    JOURNAL OF INFORMATION PROCESSING SYSTEMS, 2014, 10 (03): : 471 - 482
  • [9] An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
    Li, Huan
    Zhang, Ruisheng
    Zhao, Zhili
    Yuan, Yongna
    IEEE ACCESS, 2019, 7 : 141083 - 141093
  • [10] An algorithm for influence maximization in competitive social networks with unwanted users
    Liu, Wei
    Chen, Ling
    Chen, Xin
    Chen, Bolun
    APPLIED INTELLIGENCE, 2020, 50 (02) : 417 - 437