DeepAI AI Chat
Log In Sign Up

Fast and Error-Adaptive Influence Maximization based on Count-Distinct Sketches

by   Gokhan Gokturk, et al.

Influence maximization (IM) is the problem of finding a seed vertex set that maximizes the expected number of vertices influenced under a given diffusion model. Due to the NP-Hardness of finding an optimal seed set, approximation algorithms are frequently used for IM. In this work, we describe a fast, error-adaptive approach that leverages Count-Distinct sketches and hash-based fused sampling. To estimate the number of influenced vertices throughout a diffusion, we use per-vertex Flajolet-Martin sketches where each sketch corresponds to a sampled subgraph. To efficiently simulate the diffusions, the reach-set cardinalities of a single vertex are stored in memory in a consecutive fashion. This allows the proposed algorithm to estimate the number of influenced vertices in a single step for simulations at once. For a faster IM kernel, we rebuild the sketches in parallel only after observing estimation errors above a given threshold. Our experimental results show that the proposed algorithm yields high-quality seed sets while being up to 119x faster than a state-of-the-art approximation algorithm. In addition, it is up to 62x faster than a sketch-based approach while producing seed sets with 3 influence scores


page 7

page 10

page 11


VAIM: Visual Analytics for Influence Maximization

In social networks, individuals' decisions are strongly influenced by re...

Efficient Approximation Algorithms for Adaptive Seed Minimization

As a dual problem of influence maximization, the seed minimization probl...

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

Influence maximization aims to select k most-influential vertices or see...

Boosting Parallel Influence-Maximization Kernels for Undirected Networks with Fusing and Vectorization

Influence maximization (IM) is the problem of finding a seed vertex set ...

A Deterministic Hitting-Time Moment Approach to Seed-set Expansion over a Graph

We introduce HITMIX, a new technique for network seed-set expansion, i.e...

Influence Maximization with Few Simulations

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

The Parameterized Complexity of s-Club with Triangle and Seed Constraints

The s-Club problem asks, for a given undirected graph G, whether G conta...