|
View: |
Part 1: Document Description
|
|
Citation |
|
|---|---|
|
Title: |
Abstract graphs, abstract paths, grounded paths for Freebase and NELL |
|
Identification Number: |
doi:10.11588/data/AVLFPZ |
|
Distributor: |
heiDATA |
|
Date of Distribution: |
2019-07-15 |
|
Version: |
1 |
|
Bibliographic Citation: |
Nastase, Vivi; Kotnis, Bhushan, 2019, "Abstract graphs, abstract paths, grounded paths for Freebase and NELL", https://doi.org/10.11588/data/AVLFPZ, heiDATA, V1 |
|
Citation |
|
|
Title: |
Abstract graphs, abstract paths, grounded paths for Freebase and NELL |
|
Subtitle: |
A compact representation of typed knowledge graphs and patterns in them |
|
Identification Number: |
doi:10.11588/data/AVLFPZ |
|
Authoring Entity: |
Nastase, Vivi (Department of Computational Linguistics, Heidelberg University, Germany) |
|
Kotnis, Bhushan (Department of Computational Linguistics, Heidelberg University, Germany (2016-2018), NEC Laboratories Europe GmbH (since 2018)) |
|
|
Date of Production: |
2019 |
|
Distributor: |
heiDATA |
|
Access Authority: |
Nastase, Vivi |
|
Holdings Information: |
https://doi.org/10.11588/data/AVLFPZ |
|
Study Scope |
|
|
Keywords: |
Arts and Humanities, Computer and Information Science, knowledge graph, abstract graph, link prediction, targeted information extraction |
|
Topic Classification: |
knowledge discovery in knowledge graphs |
|
Abstract: |
<p>We describe a method for representing knowledge graphs that capture an intensional representation of the original extensional information. This representation is very compact, and it abstracts away from individual links, allowing us to find better path candidates, as shown by the results of link prediction using this information.</p> <p>The data in this archive consists of the abstract graphs built from several configurations of Freebase and NELL (used in the experiments described in Gardner et al. 2014), the abstract paths extracted from these graphs, the grounded paths and the negative sampling used in the experiments described in (Nastase and Kotnis, 2019). The motivation for this work was to find better patterns in knowledge graphs than those obtained using the PRA approach.</p> <p>This dataset contains:</p> <ul> <li> AbstractGraphs_Garder2014data.tar.gz: the abstract graphs</li> <li>AbstractPathsGroundedPaths.tar.gz: the abstract paths, grounded paths, train/test data and the corresponding negative samples (for each abstract graph)</li> </ul> <p>For a brief description of the data in each archive, please see README_AbstractGraphs.txt. </p> |
|
Kind of Data: |
text files, tab separated values |
|
Methodology and Processing |
|
|
Sources Statement |
|
|
Data Access |
|
|
Other Study Description Materials |
|
|
Related Materials |
|
|
<p>The AbstractGraphs_Garder2014data.tar.gz contains abstract graph variations for the Freebase and NELL data provided by Matt Gardner, and used in the paper:</p> <p>Matt Gardner, Partha Talukdar, Jayant Krishnamurthy, Tom Mitchell (2014). Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases. In <em>Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</em>, pages 397–406, October 25-29, 2014, Doha, Qatar.</p> <p>Linkt to the publication: <a href="https://www.aclweb.org/anthology/D14-1044">https://www.aclweb.org/anthology/D14-1044</a></p> <p>Linkt to the data: <a href="https://github.com/matt-gardner/pra">https://github.com/matt-gardner/pra</a></p> <p>License: GNU General Public License, version 3; the code makes use of a number of other libraries that are distributed under various open source licenses, for more information see: <a href="https://github.com/matt-gardner/pra">https://github.com/matt-gardner/pra</a> </p> |
|
|
Related Publications |
|
|
Citation |
|
|
Title: |
<p>Nastase, V. and Kotnis, B. (2019). Abstract Graphs and Abstract Paths for Knowledge Graph Completion. In <em>Proceedings of the Eighth Joint Conference on Lexical and Computational Semantics (*SEM 2019)</em>, June 6-7 2019, Minneapolis, USA.</p> |
|
Identification Number: |
https://www.aclweb.org/anthology/S19-1016 |
|
Bibliographic Citation: |
<p>Nastase, V. and Kotnis, B. (2019). Abstract Graphs and Abstract Paths for Knowledge Graph Completion. In <em>Proceedings of the Eighth Joint Conference on Lexical and Computational Semantics (*SEM 2019)</em>, June 6-7 2019, Minneapolis, USA.</p> |
|
Label: |
AbstractGraphs_Garder2014data.tar.gz |
|
Notes: |
application/gzip |
|
Label: |
AbstractPathsGroundedPaths.tar.gz |
|
Notes: |
application/gzip |
|
Label: |
README_AbstractGraphs.txt |
|
Notes: |
text/plain |