Knowledge Graphs (KGs) represent heterogeneous domain knowledge on the Web and within organizations.
There exist shapes constraint languages to define validating shapes to ensure the quality of the data in KGs.
Existing techniques to extract validating shapes often fail to extract complete shapes, are not scalable, and are prone to produce spurious shapes.
To address these shortcomings, we propose the Quality Shapes Extraction (QSE) approach to extract validating shapes in very large graphs, for which we devise both an exact and an approximate solution.
QSE provides information about the reliability of shape constraints by computing their confidence and support within a KG and in doing so allows to identify shapes that are most informative and less likely to be affected by incomplete or incorrect data.
To the best of our knowledge, QSE is the first approach to extract a complete set of validating shapes from WikiData.
Moreover, QSE provides a 12x reduction in extraction time compared to existing approaches, while managing to filter out up to 93% of the invalid and spurious shapes, resulting in a reduction of up to 2 orders of magnitude in the number of constraints presented to the user, e.g., from 11,916 to 809 on DBpedia.
Cite:
Rabbani, Kashif;
Lissandrini, Matteo;
and
Hose, Katja.
“Extraction of Validating Shapes from very large Knowledge Graphs.”