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

成对链接预测

Pairwise Link Prediction

Huda Nassar, Austin R. Benson, David F. Gleich

摘要:

链接预测是网络科学中的一个常见问题,涉及多个学科。目标是预测新链接的出现或找到网络中丢失的链接。用于链接预测的典型方法使用网络的拓扑来预测一对节点之间最可能的未来或丢失的连接。然而,网络演化通常是由涉及多对节点的高阶结构介导的;例如,三个节点上的集团(也称为三角形)是社交网络结构的关键,但标准的链接预测框架不能直接预测这些结构。为了解决这个差距,我们提出了一个新的链接预测任务,称为“成对链接预测“,直接针对新的三角形的预测,其中一个任务是找出哪些节点最有可能形成一个三角形与给定的边缘。我们开发了两个PageRank为基础的方法,我们成对的链接预测问题,并自然扩展到现有的链接预测方法。我们在各种网络上的实验表明,基于扩散的方法对所使用的图形类型不太敏感,并且其结果更加一致。我们还展示了我们的成对链接预测框架可以用来得到更好的预测标准的链接预测评估的上下文中。

英文摘要:

Link prediction is a common problem in network science that transects many disciplines. The goal is to forecast the appearance of new links or to find links missing in the network. Typical methods for link prediction use the topology of the network to predict the most likely future or missing connections between a pair of nodes. However, network evolution is often mediated by higher-order structures involving more than pairs of nodes; for example, cliques on three nodes (also called triangles) are key to the structure of social networks, but the standard link prediction framework does not directly predict these structures. To address this gap, we propose a new link prediction task called "pairwise link prediction" that directly targets the prediction of new triangles, where one is tasked with finding which nodes are most likely to form a triangle with a given edge. We develop two PageRank-based methods for our pairwise link prediction problem and make natural extensions to existing link prediction methods. Our experiments on a variety of networks show that diffusion based methods are less sensitive to the type of graphs used and more consistent in their results. We also show how our pairwise link prediction framework can be used to get better predictions within the context of standard link prediction evaluation.

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

↑