Datasets:

Modalities:
Text
Languages:
English
Libraries:
Datasets
License:
asahi417 commited on
Commit
c5b9b24
·
1 Parent(s): e973a0b
Files changed (2) hide show
  1. README.md +2 -5
  2. wiki.tar.gz.1 +0 -3
README.md CHANGED
@@ -17,11 +17,11 @@ pretty_name: link_prediction_nell_one
17
  - **Dataset:** Few-shots link prediction
18
 
19
  ### Dataset Summary
20
- This is NELL-ONE dataset for the few-shots link prediction.
21
 
22
  ## Dataset Structure
23
  ### Data Instances
24
- An example of `test` looks as follows.
25
  ```
26
  {
27
  "relation": "concept:sportsgamesport",
@@ -50,6 +50,3 @@ An example of `test` looks as follows.
50
  abstract = "Knowledge graphs (KG) are the key components of various natural language processing applications. To further expand KGs{'} coverage, previous studies on knowledge graph completion usually require a large number of positive examples for each relation. However, we observe long-tail relations are actually more common in KGs and those newly added relations often do not have many known triples for training. In this work, we aim at predicting new facts under a challenging setting where only one training instance is available. We propose a one-shot relational learning framework, which utilizes the knowledge distilled by embedding models and learns a matching metric by considering both the learned embeddings and one-hop graph structures. Empirically, our model yields considerable performance improvements over existing embedding models, and also eliminates the need of re-training the embedding models when dealing with newly added relations.",
51
  }
52
  ```
53
-
54
- ### LICENSE
55
- TBA
 
17
  - **Dataset:** Few-shots link prediction
18
 
19
  ### Dataset Summary
20
+ This is NELL-ONE/Wiki-One dataset for the few-shots link prediction proposed in [https://aclanthology.org/D18-1223/](https://aclanthology.org/D18-1223/).
21
 
22
  ## Dataset Structure
23
  ### Data Instances
24
+ An example of `test` of `nell` looks as follows.
25
  ```
26
  {
27
  "relation": "concept:sportsgamesport",
 
50
  abstract = "Knowledge graphs (KG) are the key components of various natural language processing applications. To further expand KGs{'} coverage, previous studies on knowledge graph completion usually require a large number of positive examples for each relation. However, we observe long-tail relations are actually more common in KGs and those newly added relations often do not have many known triples for training. In this work, we aim at predicting new facts under a challenging setting where only one training instance is available. We propose a one-shot relational learning framework, which utilizes the knowledge distilled by embedding models and learns a matching metric by considering both the learned embeddings and one-hop graph structures. Empirically, our model yields considerable performance improvements over existing embedding models, and also eliminates the need of re-training the embedding models when dealing with newly added relations.",
51
  }
52
  ```
 
 
 
wiki.tar.gz.1 DELETED
@@ -1,3 +0,0 @@
1
- version https://git-lfs.github.com/spec/v1
2
- oid sha256:6eb426b1dd72890f6d0b1f55cfcf10da386272d6586f7753c7531cac1330dfeb
3
- size 5275648