Multi-task Learning for Influence Estimation and Maximization

George Panagopoulos, Fragkiskos D. Malliaros, Michalis Vazirgiannis
4/18/2019
cs.SIcs.AIstat.ML

Official code: geopanag/IMINFECTOR (34 stars, MIT, last commit 2023-03-24).

Abstract

We address the problem of influence maximization when the social network is accompanied by diffusion cascades. In prior works, such information is used to compute influence probabilities, which is utilized by stochastic diffusion models in influence maximization. Motivated by the recent criticism on the effectiveness of diffusion models as well as the galloping advancements in influence learning, we propose IMINFECTOR (Influence Maximization with INFluencer vECTORs), a unified approach that uses representations learned from diffusion cascades to perform model-independent influence maximization that scales in real-world datasets. The first part of our methodology is a multi-task neural network that learns embeddings of nodes that initiate cascades (influencer vectors) and embeddings of nodes that participate in them (susceptible vectors). The norm of an influencer vector captures the ability of the node to create lengthy cascades and is used to estimate the expected influence spread and reduce the number of candidate seeds. In addition, the combination of influencer and susceptible vectors form the diffusion probabilities between nodes. These are used to reformulate the network as a bipartite graph and propose a greedy solution to influence maximization that retains the theoretical guarantees.We a pply our method in three sizable networks with diffusion cascades and evaluate it using cascades from future time steps. IMINFECTOR is able to scale in all of them and outperforms various competitive algorithms and metrics from the diverse landscape of influence maximization in terms of efficiency and seed set quality.

View on arXivView PDF

Code Implementations(1)

MIT
3412R, PythonApr 4, 20193 years agoMIT

Similar Papers

Cite this paper

@article{panagopoulos2019multitask,
  title  = {Multi-task Learning for Influence Estimation and Maximization},
  author = {George Panagopoulos and Fragkiskos D. Malliaros and Michalis Vazirgiannis},
  year   = {2019},
  eprint = {1904.08804},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1904.08804}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1904.08804.svg)](https://codeofpaper.com/paper/1904.08804)

Discussion