arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.07878cs.SIcs.LG
收藏

链接预测的一个隐藏挑战:检查哪些对?

A Hidden Challenge of Link Prediction: Which Pairs to Check?

University of Michigan(密歇根大学)

Caleb Belth, Alican Büyükçakır, Danai Koutra

摘要:

网络中链接预测的传统设置假设节点对的测试集(通常是平衡的)是可用的,通过该测试集来预测链接的存在。然而,在实践中,没有测试集:地面真实情况是未知的,因此预测的可能对的数量是图中节点数量的二次方。此外,由于图是稀疏的,这些可能的对中的大多数将不是链接。因此,通常依赖于保持邻近的嵌入或节点相似性的启发式概念的链接预测方法面临着巨大的搜索空间,其中许多对非常接近,但不应该被链接。为了缓解这个问题,我们引入LinkWaldo,从这个二次选择的框架,倾斜的搜索空间的节点对,一组简洁的候选对,除了在接近,也在结构上类似于观察到的边缘。这使得它可以忽略一些高接近度但低相似度的对,也可以识别高相似度,低接近度的对。我们的框架是建立在一个模型,理论上结合随机块模型(SBM)与节点邻近模型。SBM的块结构映射出在搜索空间中新链接预期落在哪里,并且接近度识别这些块内最合理的链接,使用局部敏感散列以避免昂贵的穷举搜索。LinkWaldo可以使用任何节点表示学习或邻近度的启发式定义,并且可以为任何链接预测方法生成候选对,允许当前和未来方法的表示能力在实践中实现用于链接预测。我们在多个域的13个网络上对LinkWaldo进行了评估,结果表明,它平均返回的候选集比基于嵌入和启发式基线的集多包含7-33%的缺失和未来链接。

英文摘要:

The traditional setup of link prediction in networks assumes that a test set of node pairs, which is usually balanced, is available over which to predict the presence of links. However, in practice, there is no test set: the ground-truth is not known, so the number of possible pairs to predict over is quadratic in the number of nodes in the graph. Moreover, because graphs are sparse, most of these possible pairs will not be links. Thus, link prediction methods, which often rely on proximity-preserving embeddings or heuristic notions of node similarity, face a vast search space, with many pairs that are in close proximity, but that should not be linked. To mitigate this issue, we introduce LinkWaldo, a framework for choosing from this quadratic, massively-skewed search space of node pairs, a concise set of candidate pairs that, in addition to being in close proximity, also structurally resemble the observed edges. This allows it to ignore some high-proximity but low-resemblance pairs, and also identify high-resemblance, lower-proximity pairs. Our framework is built on a model that theoretically combines Stochastic Block Models (SBMs) with node proximity models. The block structure of the SBM maps out where in the search space new links are expected to fall, and the proximity identifies the most plausible links within these blocks, using locality sensitive hashing to avoid expensive exhaustive search. LinkWaldo can use any node representation learning or heuristic definition of proximity, and can generate candidate pairs for any link prediction method, allowing the representation power of current and future methods to be realized for link prediction in practice. We evaluate LinkWaldo on 13 networks across multiple domains, and show that on average it returns candidate sets containing 7-33% more missing and future links than both embedding-based and heuristic baselines' sets.

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

↑