Pith. sign in

REVIEW 1 cited by

KGClean: An Embedding Powered Knowledge Graph Cleaning Framework

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 2004.14478 v1 pith:IV6NCFT6 submitted 2020-04-26 cs.DB

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

The quality assurance of the knowledge graph is a prerequisite for various knowledge-driven applications. We propose KGClean, a novel cleaning framework powered by knowledge graph embedding, to detect and repair the heterogeneous dirty data. In contrast to previous approaches that either focus on filling missing data or clean errors violated limited rules, KGClean enables (i) cleaning both missing data and other erroneous values, and (ii) mining potential rules automatically, which expands the coverage of error detecting. KGClean first learns data representations by TransGAT, an effective knowledge graph embedding model, which gathers the neighborhood information of each data and incorporates the interactions among data for casting data to continuous vector spaces with rich semantics. KGClean integrates an active learning-based classification model, which identifies errors with a small seed of labels. KGClean utilizes an efficient PRO-repair strategy to repair errors using a novel concept of propagation power. Extensive experiments on four typical knowledge graphs demonstrate the effectiveness of KGClean in practice.

Discussion (0). Sign in 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. Enhancing Large Language Models with Reliable Knowledge Graphs

    cs.CL 2025-06 conditional novelty 2.0 of 10

    A thesis composed of four published papers proposes contrastive KG error detection, attribute-aware error-aware embedding, inductive graph completion, and KG prompting, but adds no new result beyond those papers.

Pith tools