用冷端发现缺失的环节
Uncovering missing links with cold ends
摘要:
为了评估丢失链接预测的性能,已知数据被随机分为两部分,训练集和探测集。我们认为,这种直接和标准的方法可能会导致可怕的偏见,因为在真实的生物和信息网络中,丢失的链接更有可能是连接低度节点的链接。因此,我们研究如何发现丢失的链接与低度节点,即在探针集的链接是较低的度产品比随机抽样。对10个局部相似性指数和4个不同的真实网络的实验分析表明,Leicht-Holme-Newman指数[E. A. Leicht,P. Holme,and M. E. J. Newman,Phys.Rev.E73,026120(2006)]表现最好,尽管已知如果探测集是所有链路的随机采样,则它是最差的索引之一。我们进一步提出了一个参数依赖的指数,这大大提高了预测精度。最后,我们展示了三种真实抽样方法的相关性。
英文摘要:
To evaluate the performance of prediction of missing links, the known data are randomly divided into two parts, the training set and the probe set. We argue that this straightforward and standard method may lead to terrible bias, since in real biological and information networks, missing links are more likely to be links connecting low-degree nodes. We therefore study how to uncover missing links with low-degree nodes, namely links in the probe set are of lower degree products than a random sampling. Experimental analysis on ten local similarity indices and four disparate real networks reveals a surprising result that the Leicht-Holme-Newman index [E. A. Leicht, P. Holme, and M. E. J. Newman, Phys. Rev. E 73, 026120 (2006)] performs the best, although it was known to be one of the worst indices if the probe set is a random sampling of all links. We further propose an parameter-dependent index, which considerably improves the prediction accuracy. Finally, we show the relevance of the proposed index on three real sampling methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。