Quan Wang, Yajuan Lyu, Haifeng Wang, Yong Zhu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Link prediction on knowledge graphs (KGs) is a key research topic. Previous work mainly focused on binary relations, paying less attention to higher-arity relations although they are ubiquitous in real-world KGs. This paper considers link prediction upon n-ary relational facts and proposes a graph-based approach to this task. The key to our approach is to represent the nary structure of a fact as a small heterogeneous graph, and model this graph with edge-biased fully-connected attention. The fully-connected attention captures universal inter-vertex interactions, while with edge-aware attentive biases to particularly encode the graph structure and its heterogeneity. In this fashion, our approach fully models global and local dependencies in each n-ary fact, and hence can more effectively capture associations therein. Extensive evaluation verifies the effectiveness and superiority of our approach. It performs substantially and consistently better than current state-of-the-art across a variety of n-ary relational benchmarks. Our code is publicly available. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2105.08476")
get_code_for_paper("2105.08476")
have("2105.08476")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2105.08476.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2105.08476)
Connect an agent — have() is free.