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

05/31/2018
by   Rong Zhu, et al.
0

The Influence Maximization (IM) problem aims at finding k seed vertices in a network, starting from which influence can be spread in the network to the maximum extent. In this paper, we propose QuickIM, the first versatile IM algorithm that attains all the desirable properties of a practically applicable IM algorithm at the same time, namely high time efficiency, good result quality, low memory footprint, and high robustness. On real-world social networks, QuickIM achieves the Ω(n + m) lower bound on time complexity and Ω(n) space complexity, where n and m are the number of vertices and edges in the network, respectively. Our experimental evaluation verifies the superiority of QuickIM. Firstly, QuickIM runs 1-3 orders of magnitude faster than the state-of-the-art IM algorithms. Secondly, except EasyIM, QuickIM requires 1-2 orders of magnitude less memory than the state-of-the-art algorithms. Thirdly, QuickIM always produces as good quality results as the state-of-the-art algorithms. Lastly, the time and the memory performance of QuickIM is independent of influence probabilities. On the largest network used in the experiments that contains more than 3.6 billion edges, QuickIM is able to find hundreds of influential seeds in less than 4 minutes, while all the state-of-the-art algorithms fail to terminate in an hour.

READ FULL TEXT

page 2

page 3

page 5

page 6

page 9

page 10

page 13

page 16

research
08/01/2022

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

Influence maximization aims to select k most-influential vertices or see...
research
05/31/2017

Time is What Prevents Everything from Happening at Once: Propagation Time-conscious Influence Maximization

The influence maximization (IM) problem as defined in the seminal paper ...
research
08/27/2023

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

Real-time solutions to the influence blocking maximization (IBM) problem...
research
07/03/2019

GeoPrune: Efficiently Finding Shareable Vehicles Based on Geometric Properties

On-demand ride-sharing is rapidly growing due to its benefits of conveni...
research
01/18/2020

RCELF: A Residual-based Approach for Influence Maximization Problem

Influence Maximization Problem (IMP) is selecting a seed set of nodes in...
research
01/18/2020

RCELF: A Residual-based Approach for InfluenceMaximization Problem

Influence Maximization Problem (IMP) is selecting a seed set of nodes in...
research
03/22/2020

The Solution Distribution of Influence Maximization: A High-level Experimental Study on Three Algorithmic Approaches

Influence maximization is among the most fundamental algorithmic problem...

Please sign up or login with your details

Forgot password? Click here to reset