Predicting instance type assertions in knowledge graphs using stochastic neural networks

Weller, Tobias ; Acosta, Maribel

[img] PDF
weller2021ridle.pdf - Published

Download (6MB)

Additional URL:
URN: urn:nbn:de:bsz:180-madoc-608771
Document Type: Conference or workshop publication
Year of publication: 2021
Book title: CIKM '21 : proceedings of the 30th ACM International Conference on Information & Knowledge Management
Page range: 2111-2118
Conference title: CIKM '21
Location of the conference venue: Online
Date of the conference: 01.-05.11.2021
Publisher: Demartini, Gianluca ; Zuccon, Guido ; Culpepper, J. Shane ; Huang, Zi ; Tong, Hanghang
Place of publication: New York, NY
Publishing house: Association for Computing Machinery
ISBN: 978-1-4503-8446-9
Publication language: English
Institution: School of Business Informatics and Mathematics > Web Data Mining (Paulheim 2018-)
Pre-existing license: Creative Commons Attribution, Share Alike 4.0 International (CC BY-SA 4.0)
Subject: 004 Computer science, internet
Keywords (English): entity type prediction , entity classification , knowledge graphs , stochastic networks
Abstract: Instance type information is particularly relevant to perform reasoning and obtain further information about entities in knowledge graphs (KGs). However, during automated or pay-as-you-go KG construction processes, instance types might be incomplete or missing in some entities. Previous work focused mostly on representing entities and relations as embeddings based on the statements in the KG. While the computed embeddings encode semantic descriptions and preserve the relationship between the entities, the focus of these methods is often not on predicting schema knowledge, but on predicting missing statements between instances for completing the KG. To fill this gap, we propose an approach that first learns a KG representation suitable for predicting instance type assertions. Then, our solution implements a neural network architecture to predict instance types based on the learned representation. Results show that our representations of entities are much more separable with respect to their associations with classes in the KG, compared to existing methods. For this reason, the performance of predicting instance types on a large number of KGs, in particular on cross-domain KGs with a high variety of classes, is significantly better in terms of F1-score than previous work.
Additional information: Online-Ressource

Dieser Eintrag ist Teil der Universitätsbibliographie.

Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.

Metadata export


+ Search Authors in

+ Download Statistics

Downloads per month over past year

View more statistics

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item