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 条
  • [31] An improved influence maximization method for social networks based on genetic algorithm
    Lotf, Jalil Jabari
    Azgomi, Mohammad Abdollahi
    Dishabi, Mohammad Reza Ebrahimi
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 586
  • [32] Preserving Privacy Enables "Coexistence Equilibrium" of Competitive Diffusion in Social Networks
    Zhao, Jun
    Zhang, Junshan
    IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2017, 3 (02): : 282 - 297
  • [33] MEASURING THE INFLUENCE OF SOCIAL NETWORKS ON INFORMATION DIFFUSION ON BLOGSPHERES
    Tang, Jin-Tao
    Wang, Ting
    Wang, Ji
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 3492 - +
  • [34] Influence Maximization in Social Networks using Hurst exponent based Diffusion Model
    Saxena, Bhawna
    Saxena, Vikas
    PROCEEDINGS OF THE CONFLUENCE 2020: 10TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, DATA SCIENCE & ENGINEERING, 2020, : 167 - 171
  • [35] A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks
    Tang, Jianxin
    Zhang, Ruisheng
    Wang, Ping
    Zhao, Zhili
    Fan, Li
    Liu, Xin
    KNOWLEDGE-BASED SYSTEMS, 2020, 187
  • [36] A novel regularized weighted estimation method for information diffusion prediction in social networks
    Mashayekhi, Yoosof
    Rezvanian, Alireza
    Vahidipour, S. Mehdi
    APPLIED NETWORK SCIENCE, 2023, 8 (01)
  • [37] Greedy Local Algorithm for Overlapping Community Detection in Online Social Networks
    Singh, Ashish Kumar
    Gambhir, Sapna
    2014 5TH INTERNATIONAL CONFERENCE CONFLUENCE THE NEXT GENERATION INFORMATION TECHNOLOGY SUMMIT (CONFLUENCE), 2014, : 155 - 162
  • [38] A Novel and Model Independent Approach for Efficient Influence Maximization in Social Networks
    Lamba, Hemank
    Narayanam, Ramasuri
    WEB INFORMATION SYSTEMS ENGINEERING - WISE 2013, PT II, 2013, 8181 : 73 - 87
  • [39] CSR: A community based spreaders ranking algorithm for influence maximization in social networks
    Kumar, Sanjay
    Gupta, Aaryan
    Khatri, Inder
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2022, 25 (06): : 2303 - 2322
  • [40] CSR: A community based spreaders ranking algorithm for influence maximization in social networks
    Sanjay Kumar
    Aaryan Gupta
    Inder Khatri
    World Wide Web, 2022, 25 : 2303 - 2322