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 is an important way to complete knowledge graphs (KGs), while embedding-based methods, effective for link prediction in KGs, perform poorly on relations that only have a few associative triples. In this work, we propose a Meta Relational Learning (MetaR) framework to do the common but challenging few-shot link prediction in KGs, namely predicting new triples about a relation by only observing a few associative triples. We solve few-shot link prediction by focusing on transferring relation-specific meta information to make model learn the most important knowledge and learn faster, corresponding to relation meta and gradient meta respectively in MetaR. Empirically, our model achieves state-of-the-art results on few-shot link prediction KG benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1909.01515")
get_code_for_paper("1909.01515")
have("1909.01515")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1909.01515.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1909.01515)
Connect an agent — have() is free.