arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.00124physics.soc-phcs.SIphysics.data-an
收藏

基于线性优化的链路预测

Link prediction via linear optimization

Ratha Pech, Dong Hao, Yan-Li Lee, Ye Yuan, Tao Zhou

摘要:

链接预测是网络科学中的一个基本挑战,它已经在指导实验室实验、挖掘药物靶点、在社交网络中推荐朋友、探索网络进化机制等方面得到应用。通过一个简单的假设,即两个节点之间存在链接的可能性可以通过相邻节点贡献的线性总和展开,我们得到的最佳似然矩阵的解析解,这表明显着更好的性能,在预测丢失的链接比国家的最先进的算法,不仅简单的网络,但加权和有向网络。令我们惊讶的是,即使是来自解决方案的一些退化的局部相似性指数也优于众所周知的局部指数,这在很大程度上细化了我们的知识,例如,两个节点之间的3跳路径的数量的直接计数比2跳路径的数量更准确地预测丢失的链路(即,公共邻居的数量),而在以前的研究中,如局部路径指数和Katz指数所示,较长路径上的统计总是被认为是互补的,但不如较短路径上的统计重要。

英文摘要:

Link prediction is an elemental challenge in network science, which has already found applications in guiding laboratorial experiments, digging out drug targets, recommending friends in social networks, probing mechanisms in network evolution, and so on. With a simple assumption that the likelihood of the existence of a link between two nodes can be unfolded by a linear summation of neighboring nodes' contributions, we obtain the analytical solution of the optimal likelihood matrix, which shows remarkably better performance in predicting missing links than the state-of-the-art algorithms for not only simple networks, but also weighted and directed networks. To our surprise, even some degenerated local similarity indices from the solution outperform well-known local indices, which largely refines our knowledge, for example, the direct count of the number of 3-hop paths between two nodes more accurately predicts missing links than the number of 2-hop paths (i.e., the number of common neighbors), while in the previous studies, as indicated by the local path index and Katz index, the statistics on longer paths are always considered to be complementary to but less important than those on shorter paths.

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

↑