资源论文link prediction via ranking metric dual level attention network learning

link prediction via ranking metric dual level attention network learning

2019-10-31 | |  52 |   35 |   0
Abstract Link prediction is a challenging problem for complex network analysis, arising in many disciplines such as social networks and telecommunication networks. Currently, many existing approaches estimate the proximity of the link endpoints from the local neighborhood around them for link prediction, which suffer from the localized view of network connections. In this paper, we consider the problem of link prediction from the viewpoint of learning path-based proximity ranking metric embedding. We propose a novel proximity ranking metric attention network learning framework by jointly exploiting both node-level and path-level attention proximity of the endpoints to their betweenness paths for learning the discriminative feature representation for link prediction. We then develop the path-based dual-level attentional learning method with multi-step reasoning process for proximity ranking metric embedding. The extensive experiments on two large-scale datasets show that our method achieves better performance than other state-of-the-art solutions to the problem.

上一篇:popponent highly accurate individually and socially efficient opponent preference model in bilateral multi issue negotiations extended abstract

下一篇:multi component nonnegative matrix factorization

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...