Abstract graphs and abstract paths for knowledge graph completion
Knowledge graphs, which provide numerous facts in a machine-friendly format, are incomplete. Information that we induce from such graphs - e.g. entity embeddings, relation representations or patterns - will be affected by the imbalance in the information captured in the graph - by biasing representa...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Dokumenttyp: | Kapitel/Artikel Konferenzschrift |
| Sprache: | Englisch |
| Veröffentlicht: |
June 2019
|
| In: |
Lexical and Computational Semantics (*SEM) - proceedings of the eighth conference
Year: 2019, Pages: 147-157 |
| Online-Zugang: | Verlag, Volltext: https://www.aclweb.org/anthology/S19-1016
|
| Verfasserangaben: | Vivi Nastase, Bhushan Kotnis |
| Zusammenfassung: | Knowledge graphs, which provide numerous facts in a machine-friendly format, are incomplete. Information that we induce from such graphs - e.g. entity embeddings, relation representations or patterns - will be affected by the imbalance in the information captured in the graph - by biasing representations, or causing us to miss potential patterns. To partially compensate for this situation 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. |
|---|---|
| Beschreibung: | Gesehen am 16.07.2019 |
| Beschreibung: | Online Resource |
| ISBN: | 9781948087933 |