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

03/22/2020
by   Naoto Ohsaka, et al.
0

Influence maximization is among the most fundamental algorithmic problems in social influence analysis. Over the last decade, a great effort has been devoted to developing efficient algorithms for influence maximization, so that identifying the “best” algorithm has become a demanding task. In SIGMOD'17, Arora, Galhotra, and Ranu reported benchmark results on eleven existing algorithms and demonstrated that there is no single state-of-the-art offering the best trade-off between computational efficiency and solution quality. In this paper, we report a high-level experimental study on three well-established algorithmic approaches for influence maximization, referred to as Oneshot, Snapshot, and Reverse Influence Sampling (RIS). Different from Arora et al., our experimental methodology is so designed that we examine the distribution of random solutions, characterize the relation between the sample number and the actual solution quality, and avoid implementation dependencies. Our main findings are as follows: 1. For a sufficiently large sample number, we obtain a unique solution regardless of algorithms. 2. The average solution quality of Oneshot, Snapshot, and RIS improves at the same rate up to scaling of sample number. 3. Oneshot requires more samples than Snapshot, and Snapshot requires fewer but larger samples than RIS. We discuss the time efficiency when conditioning Oneshot, Snapshot, and RIS to be of identical accuracy. Our conclusion is that Oneshot is suitable only if the size of available memory is limited, and RIS is more efficient than Snapshot for large networks; Snapshot is preferable for small, low-probability networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
09/15/2020

GPU Accelerated RIS-based Influence Maximization Algorithm

Given a social network modeled as a weighted graph G, the influence maxi...
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
02/13/2018

Scalable Influence Maximization with General Marketing Strategies

In this paper, we study scalable algorithms for influence maximization w...
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
09/11/2023

Influence Maximization in Ising Models

Given a complex high-dimensional distribution over {± 1}^n, what is the ...
research
01/18/2020

RCELF: A Residual-based Approach for InfluenceMaximization Problem

Influence Maximization Problem (IMP) is selecting a seed set of nodes in...

Please sign up or login with your details

Forgot password? Click here to reset