A Recursive Bayesian Approach for the Link Prediction Problem


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Recently, link prediction techniques have been increasingly adopted to discover link patterns in various domains. On challenging problem is to improve the performance continually. In this paper, we propose a recursive prediction mechanism to addresses the link prediction problem. A posterior is calculated based on observed data, and then we estimate the state of the graph and use the posterior as the prior distribution for the next stage. With the increasing of iterations, the proposed approach incorporates more and more topological structure information and node attributes data. Experimental results with real-world networks have shown that the proposed solution performs better in terms of well-known metrics as compared to the existing approaches. This novel approach has already been integrated into an expert system and provides auxiliary support for decision-makers.

作者简介

Cheng Jiang

Information School, Capital University of Economics and Business

编辑信件的主要联系方式.
Email: jiangcheng@cueb.edu.cn
中国, Beijing, 100070

Jie Sui

School of Engineering Science, University of Chinese Academy of Sciences

Email: jiangcheng@cueb.edu.cn
中国, Beijing, 100049

Hua Yu

School of Engineering Science, University of Chinese Academy of Sciences

Email: jiangcheng@cueb.edu.cn
中国, Beijing, 100049

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2018