Pith. sign in

REVIEW 1 cited by

Gollum: A Gold Standard for Large Scale Multi Source Knowledge Graph Matching

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.07479 v2 pith:2NNPFXL6 submitted 2022-09-15 cs.AI

classification cs.AI
keywords knowledgematchinggoldapproachesgraphlargemultisource
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The number of Knowledge Graphs (KGs) generated with automatic and manual approaches is constantly growing. For an integrated view and usage, an alignment between these KGs is necessary on the schema as well as instance level. While there are approaches that try to tackle this multi source knowledge graph matching problem, large gold standards are missing to evaluate their effectiveness and scalability. We close this gap by presenting Gollum -- a gold standard for large-scale multi source knowledge graph matching with over 275,000 correspondences between 4,149 different KGs. They originate from knowledge graphs derived by applying the DBpedia extraction framework to a large wiki farm. Three variations of the gold standard are made available: (1) a version with all correspondences for evaluating unsupervised matching approaches, and two versions for evaluating supervised matching: (2) one where each KG is contained both in the train and test set, and (3) one where each KG is exclusively contained in the train or the test set.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Full Triple Matcher: Integrating all triple elements between heterogeneous Knowledge Graphs

    cs.CL 2025-07 conditional novelty 5.0 of 10

    Full Triple Matcher pairs semantically similar triples across two knowledge graphs, classifies them as compatible or divergent, and uses those triple pairs to improve entity alignment.

Pith tools