New research unifies KGC explanations and tackles graph exploration challenges
ByPulseAugur Editorial·[11 sources]·
Researchers are exploring new methods for knowledge graph completion (KGC) and exploration. One paper proposes a unified taxonomy for post-hoc explanations in KGC to improve reproducibility and evaluation. Another introduces Model Graph Inductive Learning (MGIL) to capture global graph structures for more accurate link prediction. Additionally, a study identifies the 'Initial Exploration Problem' (IEP) that hinders lay users from interacting with unfamiliar knowledge graphs, suggesting new interface designs. Finally, TRACE-KG is presented as a framework for context-enriched knowledge graph generation that bypasses predefined schemas.
AI
RANK_REASON
Multiple academic papers published on arXiv detailing new methods and theoretical frameworks for knowledge graph completion and exploration.
arXiv:2505.12369v2 Announce Type: replace Abstract: Multi-hop logical reasoning on knowledge graphs requires faithfully mapping the logical semantics to latent space. Current geometric embedding methods show to be useful on this task by mapping entities to geometric regions and l…
arXiv cs.LG
TIER_1English(EN)·Cosimo Gregucci, Obaidah Theeb, Daniel Hernandez, Antonio Vergari, Steffen Staab·
arXiv:2606.18001v1 Announce Type: new Abstract: Knowledge graph (KG) foundation models (KGFMs) are zero-shot generalizers: trained once, they can predict links on unseen graphs without retraining. However, understanding when and how they can robustly generalize across KGs is stil…
arXiv cs.CL
TIER_1English(EN)·Shuhang Lin, Chuhao Zhou, Xiao Lin, Zihan Dong, Kuan Lu, Zhencan Peng, Jie Yin, Dimitris N. Metaxas·
arXiv:2605.08077v2 Announce Type: replace Abstract: Knowledge Graph Question Answering (KGQA) offers grounded, interpretable reasoning, but existing methods often fail to provide reliable coverage guarantees over retrieved answers. While Conformal Prediction (CP) offers a princip…
Knowledge graph (KG) foundation models (KGFMs) are zero-shot generalizers: trained once, they can predict links on unseen graphs without retraining. However, understanding when and how they can robustly generalize across KGs is still an open question. In this paper, we shed some …
arXiv cs.AI
TIER_1English(EN)·Mohammad Sadeq Abolhasani, Yang Ba, Yixuan He, Rong Pan·
arXiv:2604.03496v2 Announce Type: replace Abstract: Knowledge graph generation typically relies either on predefined ontologies or on schema-free extraction. Ontology-driven pipelines enforce consistent typing but require costly schema design and maintenance, whereas schema-free …
arXiv:2606.16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations. However, most existing methods derive these embeddings by aggregating only the local neighborhood of each ent…
arXiv cs.AI
TIER_1English(EN)·Alessandro Lonardi, Samy Badreddine, Tarek R. Besold, Pablo Sanchez Martin·
arXiv:2507.22951v2 Announce Type: replace Abstract: Knowledge Graphs organize information as entity-relation-entity triples, enabling machine learning models to predict plausible missing triples in a task known as Knowledge Graph Completion (KGC). Post-hoc explainability for KGC …
arXiv:2602.21066v2 Announce Type: replace Abstract: Knowledge Graphs (KGs) enable the integration and representation of complex information across domains, but their semantic richness and structural complexity create substantial barriers for lay users without expertise in semanti…
Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations. However, most existing methods derive these embeddings by aggregating only the local neighborhood of each entity, neglecting the global structure of the know…
arXiv cs.LG
TIER_1English(EN)·Xihang Shan, Ye Luo·
arXiv:2606.14492v1 Announce Type: new Abstract: We present a recipe-controlled decoder audit (RCDA) for structural transductive knowledge-graph completion (KGC). The audit asks a simple reporting question: before attributing gains to an encoder or training recipe, what changes wh…
We present a recipe-controlled decoder audit (RCDA) for structural transductive knowledge-graph completion (KGC). The audit asks a simple reporting question: before attributing gains to an encoder or training recipe, what changes when the decoder is swapped under the same recipe?…