A Recursive Bayesian Approach for the Link Prediction Problem


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

Cheng Jiang

Information School, Capital University of Economics and Business

Author for correspondence.
Email: jiangcheng@cueb.edu.cn
China, Beijing, 100070

Jie Sui

School of Engineering Science, University of Chinese Academy of Sciences

Email: jiangcheng@cueb.edu.cn
China, Beijing, 100049

Hua Yu

School of Engineering Science, University of Chinese Academy of Sciences

Email: jiangcheng@cueb.edu.cn
China, Beijing, 100049

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Allerton Press, Inc.