atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Influence Maximization with $\varepsilon$-Almost Submodular Threshold Functions

NeurIPS 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Submodular influence maximization · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use TIM+ (RRset) greedy on submodular lower/upper bound thresholds (Galg-L/Galg-U) instead of baselinesinfluence maximization on eps-AS graphs · NetHEPT, Flixster, DBLPinfluence spread vs baselines: TIM-U/TIM-L outperform PageRank and High-degree in all casesHelped
Use TIM-U/TIM-L instead of PageRank on Flixster with more eps-AS nodes and larger epsinfluence maximization on eps-AS graphs · Flixster, eps=0.4influence spread vs PageRank: up to 74.2% betterHelped
Use TIM-U/TIM-L on DBLP with many eps-AS nodesinfluence maximization on eps-AS graphs · DBLP, eps=0.2influence spread vs PageRank/High-degree: PageRank and High-degree only about 2.6% behindNo clear effect
Approximation-guaranteed algorithm on graphs with more eps-AS nodes (10000 vs 3000 eps-AS-1 nodes) (ablation)TIM-U/TIM-L on NetHEPT · NetHEPT, eps=0.2influence size: influence drops obviously with 10000 nodes vs 3000Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy