arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1802.02064physics.soc-phphysics.data-an
收藏

基于熵的丢失链接预测方法

Entropy-based approach to missing-links prediction

Federica Parisi, Guido Caldarelli, Tiziano Squartini

摘要:

链接预测是网络理论中的一个活跃的研究领域,旨在从观察到的网络结构中发现缺失的连接或预测未来关系的出现。本文介绍了我们的贡献流的研究有关丢失的链接预测。在这里,我们提出了一个基于熵的方法来预测一个给定的百分比丢失的链接,通过识别它们与最可能的未观察到的。通过求解可访问网络结构上恰当定义的零模型来计算概率系数。在一组经济,金融和食品网络上将我们基于可能性的本地方法与最流行的算法进行比较后,我们发现我们的表现最好,正如许多统计指标所指出的那样(例如精度,ROC曲线下面积等)。此外,在本文件中采用的基于熵的形式主义,使我们能够直接扩展的链接预测练习,以及有向网络,从而克服了当前算法的主要局限性之一。通过采用这些方法可实现的更高的准确性-以及它们更大的灵活性-使它们成为可用链路预测算法的强有力的竞争者。

英文摘要:

Link-prediction is an active research field within network theory, aiming at uncovering missing connections or predicting the emergence of future relationships from the observed network structure. This paper represents our contribution to the stream of research concerning missing links prediction. Here, we propose an entropy-based method to predict a given percentage of missing links, by identifying them with the most probable non-observed ones. The probability coefficients are computed by solving opportunely defined null-models over the accessible network structure. Upon comparing our likelihood-based, local method with the most popular algorithms over a set of economic, financial and food networks, we find ours to perform best, as pointed out by a number of statistical indicators (e.g. the precision, the area under the ROC curve, etc.). Moreover, the entropy-based formalism adopted in the present paper allows us to straightforwardly extend the link-prediction exercise to directed networks as well, thus overcoming one of the main limitations of current algorithms. The higher accuracy achievable by employing these methods - together with their larger flexibility - makes them strong competitors of available link-prediction algorithms.

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

↑