[HTML][HTML] Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study
The influence maximization (IM) problem identifies the subset of influential users in the
network to provide solutions for real-world problems like outbreak detection, viral marketing …
network to provide solutions for real-world problems like outbreak detection, viral marketing …
Influence maximization on social graphs: A survey
Influence Maximization (IM), which selects a set of k users (called seed set) from a social
network to maximize the expected number of influenced users (called influence spread), is a …
network to maximize the expected number of influenced users (called influence spread), is a …
Community-diversified influence maximization in social networks
To meet the requirement of social influence analytics in various applications, the problem of
influence maximization has been studied in recent years. The aim is to find a limited number …
influence maximization has been studied in recent years. The aim is to find a limited number …
[HTML][HTML] Influence maximization in social networks: Theories, methods and challenges
Influence maximization (IM) is the process of choosing a set of seeds from a social network
so that the most individuals will be influenced by them. Calculating the social effect of a …
so that the most individuals will be influenced by them. Calculating the social effect of a …
Influence maximization in social networks based on discrete particle swarm optimization
Influence maximization in social networks aims to find a small group of individuals, which
have maximal influence cascades. In this study, an optimization model based on a local …
have maximal influence cascades. In this study, an optimization model based on a local …
SPIDER: A social computing inspired predictive routing scheme for softwarized vehicular networks
Software-defined vehicular network (SDVN) is a promising networking paradigm that can
provide intelligent information exchanges by separating network management and data …
provide intelligent information exchanges by separating network management and data …
TIFIM: A two-stage iterative framework for influence maximization in social networks
Influence Maximization is an important problem in social networks, and its main goal is to
select some most influential initial nodes (ie, seed nodes) to obtain the maximal influence …
select some most influential initial nodes (ie, seed nodes) to obtain the maximal influence …
An efficient memetic algorithm for influence maximization in social networks
Influence maximization is to extract a small set of nodes from a social network which
influences the propagation maximally under a cascade model. In this paper, we propose a …
influences the propagation maximally under a cascade model. In this paper, we propose a …
On the upper bounds of spread for greedy algorithms in social network influence maximization
Influence maximization, defined as finding a small subset of nodes that maximizes spread of
influence in social networks, is NP-hard under both Independent Cascade (IC) and Linear …
influence in social networks, is NP-hard under both Independent Cascade (IC) and Linear …
Finding influential nodes in multiplex networks using a memetic algorithm
In order to find the nodes with better propagation ability, a large body of studies on the
influence maximization problem has been conducted. Several influence spreading models …
influence maximization problem has been conducted. Several influence spreading models …