Research map / Learning theory and algorithms / Submodular and game algorithms
DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks
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 changed | Where | Measured | Effect |
|---|---|---|---|
| dynamic multi-step blocking instead of blocking all nodes at detection | maximum-likelihood greedy blocking · Sina Weibo network (23086 nodes) | final rumor infection ratio | Helped |
| select blocked nodes by survival likelihood instead of degree order | greedy rumor blocking · Sina Weibo network | final rumor infection ratio | Helped |
| longer block duration per node (ablation) | dynamic blocking algorithm · Sina Weibo network | final rumor infection ratio | Helped |
Closest papers by meaning
- DiffIM: Differentiable Influence Minimization with Surrogate Modeling and Continuous Relaxation (AAAI 2025 · similarity 0.86)
- Graph Bayesian Optimization for Multiplex Influence Maximization (AAAI 2024 · similarity 0.83)
- Backdoor Attack on Propagation-based Rumor Detectors (AAAI 2025 · similarity 0.83)
- REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization (AAAI 2025 · similarity 0.82)
- The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models (AAAI 2024 · similarity 0.82)
- Hyperparametric Robust and Dynamic Influence Maximization (AAAI 2025 · similarity 0.82)
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.