Neural Influence Estimator: Towards Real-time Solutions to Influence Blocking Maximization

08/27/2023
by   Wenjie Chen, et al.
0

Real-time solutions to the influence blocking maximization (IBM) problems are crucial for promptly containing the spread of misinformation. However, achieving this goal is non-trivial, mainly because assessing the blocked influence of an IBM problem solution typically requires plenty of expensive Monte Carlo simulations (MCSs). Although several approaches have been proposed to enhance efficiency, they still fail to achieve real-time solutions to IBM problems of practical scales. This work presents a novel approach that enables solving IBM problems with hundreds of thousands of nodes and edges in seconds. The key idea is to construct a fast-to-evaluate surrogate model, called neural influence estimator (NIE), as a substitute for the time-intensive MCSs. To this end, a learning problem is formulated to build the NIE that takes the false-and-true information instance as input, extracts features describing the topology and inter-relationship between two seed sets, and predicts the blocked influence. A well-trained NIE can generalize across different IBM problems defined on a social network, and can be readily combined with existing IBM optimization algorithms such as the greedy algorithm. The experiments on 25 IBM problems with up to millions of edges show that the NIE-based optimization method can be up to four orders of magnitude faster than MCSs-based optimization method to achieve the same solution quality. Moreover, given a real-time constraint of one minute, the NIE-based method can solve IBM problems with up to hundreds of thousands of nodes, which is at least one order of magnitude larger than what can be solved by existing methods.

READ FULL TEXT
research
02/27/2023

Minimizing the Influence of Misinformation via Vertex Blocking

Information cascade in online social networks can be rather negative, e....
research
05/31/2018

QuickIM: Efficient, Accurate and Robust Influence Maximization Algorithm on Billion-Scale Networks

The Influence Maximization (IM) problem aims at finding k seed vertices ...
research
01/24/2020

MONSTOR: An Inductive Approach for Estimating and Maximizing Influence over Unseen Social Networks

Influence maximization (IM) is one of the most important problems in soc...
research
02/13/2018

Scalable Influence Maximization with General Marketing Strategies

In this paper, we study scalable algorithms for influence maximization w...
research
02/28/2018

Stochastic Dynamic Programming Heuristics for Influence Maximization-Revenue Optimization

The well-known Influence Maximization (IM) problem has been actively stu...
research
11/02/2020

Blocking Adversarial Influence in Social Networks

While social networks are widely used as a media for information diffusi...
research
07/31/2019

Influence Maximization with Few Simulations

Influence maximization (IM) is the problem of finding a set of s nodes i...

Please sign up or login with your details

Forgot password? Click here to reset