A framework for managing duplicate predicates in RKGs that covers detection, resolution, and prevention that combines automated similarity-based methods with human validation and is designed for integration into the lifecycle of evolving, crowdsourced RKGs.
Abstract
Research Knowledge Graphs (RKGs) enable the structured representation of scientific knowledge, but their weakly enforced schemas make them prone to inconsistencies, particularly in how predicates are defined and used. Duplicate predicates, i.e., distinct identifiers expressing the same or highly similar relationships, introduce semantic redundancy, hinder reuse, and reduce RKG quality. While prior work has addressed duplicate detection for downstream tasks such as query answering or schema alignment, predicate redundancy as a data quality challenge, remains underexplored, particularly in terms of resolution, prevention, and semi-automated curator support. In this paper, we propose a framework for managing duplicate predicates in RKGs that covers detection, resolution, and prevention. The framework combines automated similarity-based methods with human validation and is designed for integration into the lifecycle of evolving, crowdsourced RKGs. We implement the framework in the context of the Open Research Knowledge Graph (ORKG) by extending its existing curation dashboard SciKGDash with embedding-based clustering, interactive inspection, and resolution actions such as merging and deleting. We evaluate the framework on the ORKG, where clustering reveals that up to 30% of predicates are potentially redundant. The analysis also shows recurring modeling patterns that lead to predicate redundancy, user-induced duplication, inconsistent identifier usage, and a lack of standardization in predicate naming and usage. Our findings demonstrate that duplicate predicates arise from user behavior and interface design. Addressing this, requires combining automated methods with human-centered curation and preventive mechanisms. This work positions predicate redundancy as a central data quality challenge and provides a foundation for more systematic and proactive RKG curation.
Kontrast is presented, an automatic framework that uses Text-to-SPARQL and LLM reasoning to compare table-based answers with KG evidence and categorize the resulting inconsistencies, and shows that text, tables, and KGs can complement and correct one another through systematic comparison.
This work presents a Named Entity Management System (NEMS) that integrates entity lifecycle management with scalable matching in a unified workflow for knowledge graph creation, and embeds matching and validation during ingestion, combining attribute-level similarity with graph-structured and ontology-aware signals to...
Andrea Leoni, Andrea Molinari, Simone Sandri· International Conference on...· 0 citations
This work proposes Explore-Construct-Verify (ECV), a three-stage framework for API KG construction using large language models (LLMs), which preserves LLMs’ ability to discover domain-specific knowledge while enabling efficient post-hoc validation.
Yan-Bang Sun, Qing Huang, Zhen-Chang Xing et al.· ACM Transactions on Software...· 0 citations
A novel, interpretable metric for intrinsic KG quality assessment that measures how closely an automatically extracted graph approximates an"ideal"graph capturing the key noun phrases, predicate relations, and basic linguistic phenomena such as negation expressed in the source text is proposed.
Nipun Misra, Vikranth Udandarao, Aanchal Gupta et al.· 0 citations
The rapid expansion of scientific publications has significantly increased the complexity of traditional literature review processes. While recent advances in AI-assisted screening reduce manual effort, they fail to provide an actionable organization of findings beyond thematic clustering. We propose an integrated pipe...
Le Van Olivier, Dardouillet Pierre, Boutalbi Karima· Annual International Compute...· 0 citations
guided table retrieval is presented, a four-phase pipeline that combines deterministic grounding via hash-based predictors, structural exploration of join-graph reachability, LLM-powered disambiguation of sources and targets, and algorithmic merging into minimal, topologically ordered join trees.
Alekh Jindal, J. Pandey, C. Pavlopoulou et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.