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

网络攻击下链路预测的鲁棒性

Robustness of link prediction under network attacks

Kun Wang, Lunbo Li, Cunlai Pu

摘要:

虽然网络中的链接预测多年来一直是一个热门话题,但其鲁棒性在文献中尚未得到很好的讨论。本文研究了一些主流的链路预测方法在各种网络攻击策略下的鲁棒性,包括随机攻击(RDA)、基于中心性的攻击(CA)、基于相似性的攻击(SA)和基于模拟退火的攻击(SAA)。通过对链路预测的一个典型评价指标精度的变化,我们发现对于SA和SAA,一小部分的链路删除会显著降低链路预测的性能。一般来说,SAA具有最高的攻击效率,其次是SA和CA。有趣的是,一些特定的CA策略,如基于介数的攻击(BA)的性能甚至比RDA更差。此外,我们发现,一个高性能的链接预测方法可能具有较低的攻击鲁棒性,反之亦然。

英文摘要:

While link prediction in networks has been a hot topic over the years, its robustness has not been well discussed in literature. In this paper, we study the robustness of some mainstream link prediction methods under various kinds of network attack strategies, including the random attack (RDA), centrality based attacks (CA), similarity based attacks (SA), and simulated annealing based attack (SAA). Through the variation of precision, a typical evaluation index of link prediction, we find that for the SA and SAA, a small fraction of link removals can significantly reduce the performance of link prediction. In general, the SAA has the highest attack efficiency, followed by the SA and then CA. Interestingly, the performance of some particular CA strategies, such as the betweenness based attacks (BA), are even worse than the RDA. Furthermore, we discover that a link prediction method with high performance probably has lower attack robustness, and the vice versa.

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

↑