SUBMASSIVE: Resolving Subclass Cycles in Very Large Knowledge Graphs
Abstract
Large knowledge graphs capture information of a large number of entities and their relations. Among the many relations they capture, class subsumption assertions are usually present and expressed using the \texttt{rdfs:subClassOf} construct. From our examination, publicly available knowledge graphs contain many potentially erroneous cyclic subclass relations, a problem that can be exacerbated when different knowledge graphs are integrated as Linked Open Data. In this paper, we present an automatic approach for resolving such cycles at scale using automated reasoning by encoding the problem of cycle-resolving to a MAXSAT solver. The approach is tested on the LOD-a-lot dataset, and compared against a semi-automatic version of our algorithm. We show how the number of removed triples is a trade-off against the efficiency of the algorithm.
Cite
@article{arxiv.2412.15829,
title = {SUBMASSIVE: Resolving Subclass Cycles in Very Large Knowledge Graphs},
author = {Shuai Wang and Peter Bloem and Joe Raad and Frank van Harmelen},
journal= {arXiv preprint arXiv:2412.15829},
year = {2024}
}
Comments
The paper has been presented at the 2020 workshop on Large Scale RDF Analytics (LASCAR), a workshop co-located with the Extended Semantic Web Conference (ESWC)