arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.06486cs.SI
收藏

论在线社交网络中的错误信息遏制

On Misinformation Containment in Online Social Networks

Guangmo Tong, Weili Wu, Ding-Zhu Du

摘要:

网上广泛传播的错误信息可能会引起公众恐慌和严重的经济损失。错误信息遏制问题旨在通过发起竞争活动来限制错误信息在在线社交网络中的传播。出于现实的情况下,我们提出了第一次分析的情况下,当一个任意数量的级联是允许的错误信息遏制问题。本文有四个贡献。首先,我们提供了一个形式化的多级联扩散模型,并引入了一个重要的概念称为级联优先级。其次,我们证明了错误信息遏制问题不能近似在多项式时间内的$Ω(2^{\log^{1-ε}n^4})$的一个因素,除非$NP \subseteq DTIME(n^{\polylog{n}})$。第三,我们介绍了几种类型的级联优先级,经常看到在现实的社交网络。最后,我们设计了新的算法来解决错误信息遏制问题。令人鼓舞的实验结果支持所提出的算法的有效性。

英文摘要:

The widespread online misinformation could cause public panic and serious economic damages. The misinformation containment problem aims at limiting the spread of misinformation in online social networks by launching competing campaigns. Motivated by realistic scenarios, we present the first analysis of the misinformation containment problem for the case when an arbitrary number of cascades are allowed. This paper makes four contributions. First, we provide a formal model for multi-cascade diffusion and introduce an important concept called as cascade priority. Second, we show that the misinformation containment problem cannot be approximated within a factor of $Ω(2^{\log^{1-ε}n^4})$ in polynomial time unless $NP \subseteq DTIME(n^{\polylog{n}})$. Third, we introduce several types of cascade priority that are frequently seen in real social networks. Finally, we design novel algorithms for solving the misinformation containment problem. The effectiveness of the proposed algorithm is supported by encouraging experimental results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑