基于2跳和3跳链路预测算法的实验分析
Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms
摘要:
链路预测是网络科学中一个重要而又具有挑战性的课题。大多数已知的方法是基于相似性的,其为节点对分配相似性指数,并且假设相似性较大的两个节点具有通过链路连接的较高概率。基于相似性的方法,特别是那些只基于局部信息的方法,由于其简单、可解释性和高效率,已经在不同的领域得到了成功的应用。在这个研究领域,一个直观的共识是,两个节点共享共同的邻居是很可能有一个链接,而最近的一些证据认为,3跳路径的数量更准确地预测丢失的链接比共同的邻居的数量。在本文中,我们在128个真实网络上对基于2跳和基于3跳的相似性指数进行了广泛的实验比较。我们的结果表明,基于3跳的索引表现略好,获胜率约为55.88%,但哪一个索引是最好的仍然取决于目标网络。总的来说,Cannistraci-Hebb指数类在所有考虑的候选人中表现最好。
英文摘要:
Link prediction is a significant and challenging task in network science. The majority of known methods are similarity-based, which assign similarity indices for node pairs and assume that two nodes of larger similarity have higher probability to be connected by a link. Due to their simplicity, interpretability and high efficiency, similarity-based methods, in particular those based only on local information, have already found successful applications on disparate fields. In this research domain, an intuitive consensus is that two nodes sharing common neighbors are very likely to have a link, while some recent evidences argue that the number of 3-hop paths more accurately predicts missing links than the number of common neighbors. In this paper, we implement extensive experimental comparisons between 2-hop-based and 3-hop-based similarity indices on 128 real networks. Our results indicate that the 3-hop-based indices perform slightly better with a winning rate about 55.88%, but which index is the best one still depends on the target network. Overall speaking, the class of Cannistraci-Hebb indices performs the best among all considered candidates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。