FastCover: An Unsupervised Learning Framework for Multi-Hop Influence Maximization in Social Networks

10/31/2021
by   Runbo Ni, et al.
0

Finding influential users in social networks is a fundamental problem with many possible useful applications. Viewing the social network as a graph, the influence of a set of users can be measured by the number of neighbors located within a given number of hops in the network, where each hop marks a step of influence diffusion. In this paper, we reduce the problem of IM to a budget-constrained d-hop dominating set problem (kdDSP). We propose a unified machine learning (ML) framework, FastCover, to solve kdDSP by learning an efficient greedy strategy in an unsupervised way. As one critical component of the framework, we devise a novel graph neural network (GNN) architecture, graph reversed attention network (GRAT), that captures the diffusion process among neighbors. Unlike most heuristic algorithms and concurrent ML frameworks for combinatorial optimization problems, FastCover determines the entire seed set from the nodes' scores computed with only one forward propagation of the GNN and has a time complexity quasi-linear in the graph size. Experiments on synthetic graphs and real-world social networks demonstrate that FastCover finds solutions with better or comparable quality rendered by the concurrent algorithms while achieving a speedup of over 1000x.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2020

Earned Benefit Maximization in Social Networks Under Budget Constraint

Given a social network with nonuniform selection cost of the users, the ...
research
04/21/2022

Maximizing the Influence of Bichromatic Reverse k Nearest Neighbors in Geo-Social Networks

Geo-social networks offer opportunities for the marketing and promotion ...
research
11/06/2022

A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization

Influence Maximization (IM) is a classical combinatorial optimization pr...
research
06/21/2019

Coupled Graph Neural Networks for Predicting the Popularity of Online Content

Predicting the popularity of online content in social network is an impo...
research
10/14/2022

ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning

Online social platforms have become more and more popular, and the disse...
research
08/10/2021

Learning to Maximize Influence

As the field of machine learning for combinatorial optimization advances...
research
10/09/2019

A k-hop Collaborate Game Model: Adaptive Strategy to Maximize Total Revenue

In Online Social Networks (OSNs), interpersonal communication and inform...

Please sign up or login with your details

Forgot password? Click here to reset