Neighbor-Based Link Prediction with Edge Uncertainty
In this work,we are concerned with uncertain networks and focus on the problem of link prediction with edge uncertainty.Networks with edge uncertainty are networks where connections between nodes are observed with some probability.We propose the uncertain version of the popular neighbors-based metrics for link prediction.The metrics are developed by considering all possible worlds generated by the uncertain network.We state that by taking all possible worlds of the uncertain network into account,the performance of link prediction can be improved.Since uncertain edges result in a very large number of possible worlds,we propose an efficient divide and conquer algorithm to reduce time complexity and calculate these metrics.Finally,we evaluate our metrics using existing ground truth to show the effectiveness of our proposed approach against other popular link prediction methods.
Social network analysis Link prediction Uncertain networks
Chi Zhang Osmar R.Za(i)ane
Department of Computing Science,University of Alberta,Edmonton,AB,Canada
国际会议
澳门
英文
462-474
2019-04-14（万方平台首次上网日期，不代表论文的发表时间）