社交网络中冲突风险最小化的近似线性时间算法
A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks
摘要:
伴随着在线社交媒体平台的巨大普及,个人之间的互动空前增强。人们可以自由地与熟人互动,通过在线社交媒体上的评论、点赞、转发等方式表达和交流自己的观点,从而引发了对有争议的社会问题的抵制、争议等重要现象,这也是近期许多作品的主题。本文研究了社交网络中通过修改少量节点的初始意见来最小化冲突风险的问题。我们证明了该组合优化问题的目标函数是单调的和超模的。然后,我们提出了一个天真的贪心算法与$(1-1/e)$近似比,解决了问题的立方时间。为了克服大型网络的计算挑战,我们进一步整合了几个有效的近似策略,以提供一个几乎线性的时间算法与$(1-1/e-ε)$近似比的任何错误参数$ε>0$。在各种真实数据集上的大量实验证明了我们算法的效率和有效性。特别是,快速的一个扩展到超过200万个节点的大型网络,并实现了$20\times$的速度比最先进的算法。
英文摘要:
Concomitant with the tremendous prevalence of online social media platforms, the interactions among individuals are unprecedentedly enhanced. People are free to interact with acquaintances, express and exchange their own opinions through commenting, liking, retweeting on online social media, leading to resistance, controversy and other important phenomena over controversial social issues, which have been the subject of many recent works. In this paper, we study the problem of minimizing risk of conflict in social networks by modifying the initial opinions of a small number of nodes. We show that the objective function of the combinatorial optimization problem is monotone and supermodular. We then propose a na\"ıve greedy algorithm with a $(1-1/e)$ approximation ratio that solves the problem in cubic time. To overcome the computation challenge for large networks, we further integrate several effective approximation strategies to provide a nearly linear time algorithm with a $(1-1/e-ε)$ approximation ratio for any error parameter $ε>0$. Extensive experiments on various real-world datasets demonstrate both the efficiency and effectiveness of our algorithms. In particular, the fast one scales to large networks with more than two million nodes, and achieves up to $20\times$ speed-up over the state-of-the-art algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。