A survey on meta-heuristic algorithms for the influence maximization problem in the social networks

Computing ◽  
2021 ◽  
Author(s):  
Zahra Aghaee ◽  
Mohammad Mahdi Ghasemi ◽  
Hamid Ahmadi Beni ◽  
Asgarali Bouyer ◽  
Afsaneh Fatemi
Keyword(s):  
Social Networks ◽  
Heuristic Algorithms ◽  
Influence Maximization ◽  
Maximization Problem ◽  
The Social ◽  
Influence Maximization Problem

scholarly journals Influence Maximization in Social Network Considering Memory Effect and Social Reinforcement Effect

2019 ◽  
Vol 11 (4) ◽  
pp. 95
Author(s):  
Wang ◽  
Zhu ◽  
Liu ◽  
Wang
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Memory Effect ◽  
Influence Maximization ◽  
Viral Marketing ◽  
Maximization Problem ◽  
Social Reinforcement ◽  
Reinforcement Effect ◽  
The Social ◽  
Influence Maximization Problem

Social networks have attracted a lot of attention as novel information or advertisement diffusion media for viral marketing. Influence maximization describes the problem of finding a small subset of seed nodes in a social network that could maximize the spread of influence. A lot of algorithms have been proposed to solve this problem. Recently, in order to achieve more realistic viral marketing scenarios, some constrained versions of influence maximization, which consider time constraints, budget constraints and so on, have been proposed. However, none of them considers the memory effect and the social reinforcement effect, which are ubiquitous properties of social networks. In this paper, we define a new constrained version of the influence maximization problem that captures the social reinforcement and memory effects. We first propose a novel propagation model to capture the dynamics of the memory and social reinforcement effects. Then, we modify two baseline algorithms and design a new algorithm to solve the problem under the model. Experiments show that our algorithm achieves the best performance with relatively low time complexity. We also demonstrate that the new version captures some important properties of viral marketing in social networks, such as such as social reinforcements, and could explain some phenomena that cannot be explained by existing influence maximization problem definitions.

scholarly journals A novel approach for fast and effective influence spread maximization in social networks

2020 ◽  
Author(s):  
Paolo Scarabaggio ◽  
Raffaele Carli ◽  
Mariagrazia Dotoli
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Influence Maximization ◽  
Viral Marketing ◽  
Computational Time ◽  
Maximization Problem ◽  
Influence Spread ◽  
The Social ◽  
Spread Of Influence ◽  
Influence Maximization Problem

The main characteristic of social networks is their ability to quickly spread information between a large group of people. This phenomenon is generated by the social influence that individuals induce on each other.<br>The widespread use of online social networks (e.g., Facebook) increases researchers' interest in how influence propagates through these networks. One of the most important research issues in this field is the so-called influence maximization problem, which essentially consists in selecting the most influential users (i.e., those who are able to maximize the spread of influence through the social network).<br>Due to its practical importance in various applications (e.g., viral marketing, target advertisement, personalized recommendation), such a problem has been studied in several variants. Different solution methodologies have been proposed. Nevertheless, the current open challenge in the resolution of the influence maximization problem still concerns achieving a good trade-off between accuracy and computational time. <br>In this context, based on the well-known independent cascade and the linear threshold models of social networks, we propose a novel low-complexity and highly accurate algorithm for selecting an initial group of nodes to maximize the spread of influence in large-scale networks. In particular, the key idea consists in iteratively removing the overlap of influence spread induced by different seed nodes. Application to several numerical experiments based on real datasets proves that the proposed algorithm effectively finds practical near-optimal solutions of the addressed influence maximization problem in a computationally efficient fashion. Finally, comparison with the best performing state of the art algorithms demonstrates that in large scale scenarios, the proposed approach shows higher performance in terms of influence spread and running time.

scholarly journals A novel approach for fast and effective influence spread maximization in social networks

2020 ◽  
Author(s):  
Paolo Scarabaggio ◽  
Raffaele Carli ◽  
Mariagrazia Dotoli
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Influence Maximization ◽  
Viral Marketing ◽  
Computational Time ◽  
Maximization Problem ◽  
Influence Spread ◽  
The Social ◽  
Spread Of Influence ◽  
Influence Maximization Problem

The main characteristic of social networks is their ability to quickly spread information between a large group of people. This phenomenon is generated by the social influence that individuals induce on each other.<br>The widespread use of online social networks (e.g., Facebook) increases researchers' interest in how influence propagates through these networks. One of the most important research issues in this field is the so-called influence maximization problem, which essentially consists in selecting the most influential users (i.e., those who are able to maximize the spread of influence through the social network).<br>Due to its practical importance in various applications (e.g., viral marketing, target advertisement, personalized recommendation), such a problem has been studied in several variants. Different solution methodologies have been proposed. Nevertheless, the current open challenge in the resolution of the influence maximization problem still concerns achieving a good trade-off between accuracy and computational time. <br>In this context, based on the well-known independent cascade and the linear threshold models of social networks, we propose a novel low-complexity and highly accurate algorithm for selecting an initial group of nodes to maximize the spread of influence in large-scale networks. In particular, the key idea consists in iteratively removing the overlap of influence spread induced by different seed nodes. Application to several numerical experiments based on real datasets proves that the proposed algorithm effectively finds practical near-optimal solutions of the addressed influence maximization problem in a computationally efficient fashion. Finally, comparison with the best performing state of the art algorithms demonstrates that in large scale scenarios, the proposed approach shows higher performance in terms of influence spread and running time.

scholarly journals Influence Maximization in Social Networks using Deterministic Crowding Algorithm

2019 ◽  
Vol 8 (11) ◽  
pp. 4258-4265
Keyword(s):  
Social Network ◽  
Information Diffusion ◽  
Influence Maximization ◽  
Maximization Problem ◽  
Linear Threshold ◽  
The Social ◽  
Spread Of Influence ◽  
Influential Users ◽  
High Influence ◽  
Influence Maximization Problem

In a social network the individuals connected to one another become influenced by one another, while some are more influential than others and able to direct groups of individuals towards a move, an idea and an entity. These individuals are named influential users. Attempt is made by the social network researchers to identify such individuals because by changing their behaviors and ideologies due to communications and the high influence on one another would change many others' behaviors and ideologies in a given community. In information diffusion models, at all stages, individuals are influenced by their neighboring people. These influences and impressions thereof are constructive in an information diffusion process. In the Influence Maximization problem, the goal is to finding a subset of individuals in a social network such that by activating them, the spread of influence is maximized. In this work a new algorithm is presented to identify most influential users under the linear threshold diffusion model. It uses explicit multimodal evolutionary algorithms. Four different datasets are used to evaluate the proposed method. The results show that the precision of our method in average is improved 4.8% compare to best known previous works.

FSIM: A Fast and Scalable Influence Maximization Algorithm Based on Community Detection

2018 ◽  
Vol 26 (03) ◽  
pp. 379-396 ◽  
Author(s):  
Esmaeil Bagheri ◽  
Gholamhossein Dastghaibyfard ◽  
Ali Hamzeh
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Influence Maximization ◽  
Experimental Results ◽  
Maximization Problem ◽  
Maximization Algorithms ◽  
New Algorithms ◽  
Influence Maximization Problem

Influence maximization algorithms try to select a set of individuals in social networks that are more influential. The Influence maximization problem is important in marketing and many researchers has researched on it and proposed new algorithms. All proposed algorithms are not scalable and are very time consuming for very large social networks generally. In this paper, a fast and scalable influence maximization algorithm called FSIM is proposed based on community detection. FSIM algorithm decreases number of nodes that must be examined without loss of the operations quality therefore it can find seeds quickly. FSIM can maximize influence in large social networks. Experimental results show FSIM is faster and more scalable than existing algorithms.

Sign in / Sign up

Export Citation Format

Share Document