通过节点阻塞实现高效影响最小化
Efficient Influence Minimization via Node Blocking
AI总结:
针对节点阻塞式影响最小化问题计算开销大、缺乏理论保证的痛点,基于Sandwich框架构建子模边界,结合采样与鞅集中边界设计近似算法,实现最高两个数量级加速并提供理论保证。
摘要:
给定图G、预算k和错误信息种子集S,基于节点阻塞的影响最小化(Influence Minimization,IMIN)旨在找到k个待阻塞的节点,使得S的预期传播范围最小化。该问题在抑制错误信息传播方面具有重要应用,已有大量文献对其展开研究。但现有IMIN解决方案仍存在计算开销过大的问题,尤其是当k值较大时。此外,在我们的工作之前,尚无针对节点阻塞式IMIN的、具备非平凡理论保证的近似求解方案。本文首次尝试提出能给出数据相关近似保证的算法。基于Sandwich框架,我们首先为非子模目标函数构建了子模且单调的上下界,并证明所提边界的计算属于#P难问题。此外,我们提出了两种先进的采样方法来估计边界函数的值。我们还开发了两种基于鞅的新型集中边界以降低样本复杂度,并设计了两种非平凡算法,可为边界函数提供(1-1/e-ε)近似解。我们在9个真实世界数据集上开展了综合实验,以验证所提技术的效率与有效性。与现有最优方法相比,我们的方案最多可实现两个数量级的加速,且能为返回结果的质量提供理论保证。
英文摘要:
Given a graph G, a budget k and a misinformation seed set S, Influence Minimization (IMIN) via node blocking aims to find a set of k nodes to be blocked such that the expected spread of S is minimized. This problem finds important applications in suppressing the spread of misinformation and has been extensively studied in the literature. However, existing solutions for IMIN still incur significant computation overhead, especially when k becomes large. In addition, there is still no approximation solution with non-trivial theoretical guarantee for IMIN via node blocking prior to our work. In this paper, we conduct the first attempt to propose algorithms that yield data-dependent approximation guarantees. Based on the Sandwich framework, we first develop submodular and monotonic lower and upper bounds for our non-submodular objective function and prove the computation of proposed bounds is \#P-hard. In addition, two advanced sampling methods are proposed to estimate the value of bounding functions. Moreover, we develop two novel martingale-based concentration bounds to reduce the sample complexity and design two non-trivial algorithms that provide (1-1/e-ε)-approximate solutions to our bounding functions. Comprehensive experiments on 9 real-world datasets are conducted to validate the efficiency and effectiveness of the proposed techniques. Compared with the state-of-the-art methods, our solutions can achieve up to two orders of magnitude speedup and provide theoretical guarantees for the quality of returned results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。