1 Introduction
-
A proposal to categorize existing methods to solve the IM problem into behaviour-agnostic and behaviour-aware, which is motivated by the realization that behavioural characteristics of users play a key role in IM.
-
A taxonomy and a detailed review of behaviour-aware methods for the IM problem, which discusses the behavioural characteristics that have been taken into account to solve the IM problem, how these characteristics are modelled and how the properties of the problem are affected by taking into account these characteristics.
-
A discussion of challenges for the IM problem from a behaviour-aware perspective.
2 Preliminaries
2.1 Problem description
2.2 Influence detection
-
Centrality measures determine the influence of each node in the social network graph based on topological properties. Different centrality measures have been proposed and extended to determine the influence of nodes (Freeman 1978, 1977; Sabidussi 1966; Zareie et al. 2017; Lü et al. 2016; Zareie and Sheikhahmadi 2019; Kitsak et al. 2010).
-
Simulation of the spreading process can be used to determine the influence of each node and select a set of influential nodes. Different diffusion models have been proposed to simulate the spreading process. The Independent Cascade (IC) model (Carnes et al. 2007; Goldenberg et al. 2001; Kempe et al. 2003) and the Linear Threshold (LT) model (Borodin et al. 2010; Granovetter 1978; Kempe et al. 2003) are the models that have been widely applied. In the IC model, the spreading process is simple, which means the propagation on the edges is mutually independent and interaction with one active node may be enough for a node to be activated (influenced). In the LT model, the spreading process is complex, which means a node may need to interact with multiple active nodes to be activated (influenced) (Chen et al. 2013).
-
Maximum Influence Arborescence (MIA) (Chen et al. 2010) relies on the spreading probability on paths between pairs of nodes in the social network graph; the spreading probability on a path is calculated by multiplying the spreading probability on the edges of the path.
2.3 Influence maximization
3 Behaviour-aware methods
3.1 Interest-aware methods
3.1.1 Target-aware methods
3.1.2 Label-aware methods
3.1.3 Topic-aware methods
3.1.4 Summary
Category | Paper (year) | Behavioural features | Influence detection | Spreading process | ||||||
---|---|---|---|---|---|---|---|---|---|---|
AM | BV | BE | CM | SS | RIS | MIA | Simple | Complex | ||
Target-aware |
White and Smyth (2003) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Mochalova and Nanopoulos (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Wen et al. (2018d) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Srinivasan et al. (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Calio et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Caliò and Tagarelli (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Padmanabhan et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Lohia et al. (2020) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Label-aware |
Li et al. (2011) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||
Liu et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Li et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Tejaswi et al. (2017) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Ke et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Partly offline topic-aware |
Li et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||
Aslay et al. (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Chen et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Chen et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Online topic-aware |
Barbieri et al. (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||
Singh et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Zareie et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Zhou et al. (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Tian et al. (2020) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Li et al. (2020) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) |
3.2 Opinion-aware methods
3.2.1 Trust-agnostic methods
3.2.2 Trust-aware methods
3.2.3 Summary
Category | Paper (year) | Behavioural features | Influence detection | Spreading process | ||||||
---|---|---|---|---|---|---|---|---|---|---|
AM | BV | BE | CM | SS | RIS | MIA | Simple | Complex | ||
Trust-agnostic |
Gionis et al. (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Zhang et al. (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Wang et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
He et al. (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
He et al. (2023) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Chen et al. (2011) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Nazemian and Taghiyareh (2012) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Trust-aware |
Li et al. (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Wang et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Liang et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Lei et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Chen and He (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Li et al. (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Li et al. (2017) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Ju et al. (2020) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Srivastava et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Hosseini-Pozveh et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Mohamadi-Baghmolaei et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
He et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Liang et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Ahmed and Ezeife (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Wang et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
He et al. (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
He et al. (2022) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) |
3.3 Money-aware methods
3.3.1 Cost-aware methods
3.3.2 Profit-aware methods
3.3.3 Summary
Category | Paper (year) | Behavioural features | Influence detection | Spreading process | ||||||
---|---|---|---|---|---|---|---|---|---|---|
AM | BV | BE | CM | SS | RIS | MIA | Simple | Complex | ||
Cost-Aware |
Nguyen and Zheng (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Han et al. (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Banerjee et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Banerjee et al. (2020) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Yu et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Du et al. (2013) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Güney (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Wang et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
de Souza et al. (2020) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Han et al. (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Profit-Aware |
Nguyen et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Zhang et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Lu and Lakshmanan (2012) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Tang et al. (2017) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Banerjee et al. (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Banerjee et al. (2020a) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Zhu et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) |
3.4 Physical world-aware methods
3.4.1 Physical relationship-aware methods
3.4.2 Location-aware methods
3.4.3 Summary
Category | Paper (year) | Behavioural features | Influence detection | Spreading process | ||||||
---|---|---|---|---|---|---|---|---|---|---|
AM | BV | BE | CM | SS | RIS | MIA | Simple | Complex | ||
Physical relationship-aware |
Yang et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Li et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Chen et al. (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Li et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||||
Hosseinpour et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Location-aware |
Li et al. (2014) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Wang et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | |||||
Wang et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Song et al. (2016) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Wang et al. (2019) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Zhou et al. (2015) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Li et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Su et al. (2018) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | ||||||
Gu et al. (2021) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) | \(\checkmark \) |