Approximate Solutions for the Influence Maximization Problem in a Social Network

2006 ◽  
pp. 937-944 ◽  
Author(s):  
Masahiro Kimura ◽  
Kazumi Saito
Keyword(s):  
Social Network ◽  
Approximate Solutions ◽  
Influence Maximization ◽  
Maximization Problem ◽  
Influence Maximization Problem

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.

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 Community-based framework for influence maximization problem in social networks

2021 ◽  
Vol 24 (3) ◽  
pp. 1604
Author(s):  
Mustafa K. Alasadi ◽  
Ghusoon Idan Arb
Keyword(s):  
Community Structure ◽  
Social Network ◽  
Diffusion Process ◽  
Influence Maximization ◽  
Viral Marketing ◽  
Community Diversity ◽  
Maximization Problem ◽  
Special Role ◽  
The Social ◽  
Influence Maximization Problem

<p>Given a social graph, the influence maximization problem (IMP) is the act of selecting a group of nodes that cause maximum influence if they are considered as seed nodes of a diffusion process. IMP is an active research area in social network analysis due to its practical need in applications like viral marketing, target advertisement, and recommendation system. In this work, we propose an efficient solution for IMP based on the social network structure. The community structure is a property of real-world graphs. In fact, communities are often overlapping because of the involvement of users in many groups (family, workplace, and friends). These users are represented by overlapped nodes in the social graphs and they play a special role in the information diffusion process. This fact prompts us to propose a solution framework consisting of three phases: firstly, the community structure is discovered, secondly, the candidate seeds are generated, then lastly the set of final seed nodes are selected. The aim is to maximize the influence with the community diversity of influenced users. The study was validated using synthetic as well as real social network datasets. The experimental results show improvement over baseline methods and some important conclusions were reported.</p>

Nonsubmodular Constrained Profit Maximization in Attribute Networks

2021 ◽  
Author(s):  
Liman Du ◽  
Wenguo Yang ◽  
Suixiang Gao
Keyword(s):  
Profit Maximization ◽  
Logistic Function ◽  
Influence Maximization ◽  
Maximization Problem ◽  
Cardinality Constraint ◽  
Three Phase ◽  
Marginal Increment ◽  
The Difference ◽  
Classical Influence ◽  
Influence Maximization Problem

The number of social individuals who interact with their friends through social networks is increasing, leading to an undeniable fact that word-of-mouth marketing has become one of the useful ways to promote sale of products. The Constrained Profit Maximization in Attribute network (CPMA) problem, as an extension of the classical influence maximization problem, is the main focus of this paper. We propose the profit maximization in attribute network problem under a cardinality constraint which is closer to the actual situation. The profit spread metric of CPMA calculates the total benefit and cost generated by all the active nodes. Different from the classical Influence Maximization problem, the influence strength should be recalculated according to the emotional tendency and classification label of nodes in attribute networks. The profit spread metric is no longer monotone and submodular in general. Given that the profit spread metric can be expressed as the difference between two submodular functions and admits a DS decomposition, a three-phase algorithm named as Marginal increment and Community-based Prune and Search(MCPS) Algorithm frame is proposed which is based on Louvain algorithm and logistic function. Due to the method of marginal increment, MPCS algorithm can compute profit spread more directly and accurately. Experiments demonstrate the effectiveness of MCPS algorithm.

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
Sign in / Sign up

Export Citation Format

Share Document