Towards proactive rumor control: When a budget constraint meets impression counts

扫码查看

原文链接

NETL
NSTL
Elsevier

外文摘要：© 2024 Elsevier B.V.The proliferation of rumors in online networks poses significant public safety risks and economic repercussions. Addressing this, we investigate the understudied aspect of rumor control: the interplay between influence block effect and user impression counts under budget constraints. We introduce two problem variants, RCIC and RCICB, tailored for diverse application contexts. Our study confronts two inherent challenges: the NP-hard nature of the problems and the non-submodularity of the influence block, which precludes direct greedy approaches. We develop a novel branch-and-bound framework for RCIC, achieving a (1−1/e−ϵ) approximation ratio, and enhance its efficacy with a progressive upper bound estimation, refining the ratio to (1−1/e−ϵ−ρ). Extending these techniques to RCICB, we attain approximation ratios of ([Formula presented](1−1/e−ρ)−ϵ). We conduct experiments on real-world datasets to verify the efficiency, effectiveness, and scalability of our methods.

外文关键词：

Non-submodularityRandom walkRumor controlSocial network

作者：

Xu P.、Peng Z.、Wang L.

展开 >

作者单位：

School of Computer Science Wuhan University

出版年：

2025

DOI：

10.1016/j.comcom.2024.108010

Computer communications

SCI

ISSN：0140-3664

年,卷(期)：2025.230(Jan.)

参考文献量18