Pith. sign in

REVIEW 20 cited by

KG-BERT: BERT for Knowledge Graph Completion

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 1909.03193 v2 pith:GGC4SKMJ submitted 2019-09-07 cs.CL cs.AI

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

Knowledge graphs are important resources for many artificial intelligence tasks but often suffer from incompleteness. In this work, we propose to use pre-trained language models for knowledge graph completion. We treat triples in knowledge graphs as textual sequences and propose a novel framework named Knowledge Graph Bidirectional Encoder Representations from Transformer (KG-BERT) to model these triples. Our method takes entity and relation descriptions of a triple as input and computes scoring function of the triple with the KG-BERT language model. Experimental results on multiple benchmark knowledge graphs show that our method can achieve state-of-the-art performance in triple classification, link prediction and relation prediction tasks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 20 Pith papers

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

  1. DeepRefine: Agent-Compiled Knowledge Refinement via Reinforcement Learning

    cs.CL 2026-05 unverdicted novelty 7.0 of 10

    DeepRefine refines agent-compiled knowledge bases via multi-turn abductive diagnosis and RL training with a GBD reward, yielding consistent downstream task gains.

  2. Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Relation operators in knowledge graphs are Kraus channels obeying three axioms, enabling KrausKGE which outperforms baselines on N-to-N relations and supplies a rank-based complexity measure.

  3. Toward a Unified Statistical Theory of Unsupervised Pretraining and Supervised Neural Knowledge Graph Learning

    math.ST 2026-07 conditional novelty 6.0 of 10

    A four-term oracle inequality decomposes knowledge-graph prediction risk into approximation, estimation, optimization, and multi-view pretraining error, with a subspace-recovery guarantee for kernel PCA pretraining.

  4. CORE: Cyclic Orthotope Relation Embedding for Knowledge Graph Completion

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    CORE embeds relations as cyclic orthotopes on a torus with adaptive width regularization to enable boundary-less optimization and capture complex logical patterns in knowledge graphs.

  5. RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion

    cs.AI 2026-04 unverdicted novelty 6.0 of 10

    RADD decouples retrieval and reranking in multi-modal KGC via a relation-aware KGE retriever and conditional discrete denoiser, reporting state-of-the-art results on three benchmarks.

  6. Predicting New Concept-Object Associations in Astronomy by Mining the Literature

    astro-ph.IM 2026-02 unverdicted novelty 6.0 of 10

    Matrix factorization on a literature-mined concept-object graph predicts future associations in astronomy better than neighborhood similarity or recency heuristics.

  7. Panning for Gold: Expanding Domain-Specific Knowledge Graphs with General Knowledge

    cs.AI 2026-01 reject novelty 6.0 of 10

    ExeFuse uses learned 'logic' transformations and density checks to fuse general-graph facts into domain knowledge graphs, but the benchmark labels and baseline comparisons are too underspecified to support the claimed gains.

  8. Structured and Abstractive Reasoning on Multi-modal Relational Knowledge Images

    cs.CV 2025-10 unverdicted novelty 6.0 of 10

    Authors build a synthetic data generator and two-stage training pipeline for structured abstractive reasoning on multi-modal relational knowledge images, releasing STAR-64K and showing 3B/7B models outperforming GPT-4o.

  9. Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement Learning

    cs.CL 2025-09 unverdicted novelty 6.0 of 10

    KG-R1 trains a single RL agent to retrieve from and reason over knowledge graphs in one loop, achieving higher accuracy with fewer tokens than multi-module baselines and transferring to unseen graphs.

  10. Towards Explainable Job Title Matching: Leveraging Semantic Textual Relatedness and Knowledge Graphs

    cs.CL 2025-09 conditional novelty 6.0 of 10

    A self-supervised pipeline that pairs fine-tuned SBERT with a skill knowledge graph reduces RMSE for highly related job title pairs to 0.11, about 25% to 39% below strong baselines.

  11. Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning

    cs.CL 2025-09 reject novelty 6.0 of 10

    SAT uses hierarchical contrastive alignment and a unified graph instruction to tune a lightweight adapter for knowledge graph completion, reporting large link prediction gains.

  12. Representation learning to advance multi-institutional studies with electronic health record data from US and France

    cs.AI 2025-02 unverdicted novelty 6.0 of 10

    A graph-based framework learns a shared semantic space for EHR data harmonization by integrating site-specific summaries, biomedical knowledge graphs, and LLM semantics, evaluated across seven institutions in two languages.

  13. Inductive Entity Representations from Text via Link Prediction

    cs.CL 2020-10 unverdicted novelty 6.0 of 10

    Entity representations learned from text via link prediction generalize to unseen entities and transfer to classification and retrieval with reported gains of 22% MRR, 16% accuracy, and 8.8% NDCG@10.

  14. Sentence Splitter: Uncovering Latent Factual Structure for Self-Supervised Learning

    cs.CL 2026-07 conditional novelty 5.0 of 10

    A T5-based sentence splitter trained on verbalized knowledge-graph triples extracts prefix–tail pairs from raw text, and the resulting structure-aware supervision raises few-shot CommonsenseQA and ATOMIC completion scores.

  15. RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion

    cs.AI 2026-04 conditional novelty 5.0 of 10

    A retrieve-then-rerank framework using a KGE shortlist and a discrete diffusion reranker reports SOTA MMKGC scores, but the diffusion mechanism is underspecified and not isolated from a generic reranker.

  16. GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion

    cs.AI 2026-04 unverdicted novelty 5.0 of 10

    GS-Quant generates coarse-to-fine discrete codes for KG entities via semantic hierarchy injection and causal sequence reconstruction, enabling LLMs to perform knowledge graph completion by treating the codes as vocabu...

  17. Extending Ontologies: From Dense Embeddings to Hybrid Quantum-Fuzzy Systems

    cs.AI 2026-06 unverdicted novelty 4.0 of 10

    Proposes neuro-quantum-fuzzy systems via quantum-neural networks to enable simultaneous probabilistic and crisp inference in ontology-based knowledge representation.

  18. ClinQueryAgent: A Conversational Agent for Population Health Management

    cs.IR 2026-04 unverdicted novelty 4.0 of 10

    The paper introduces ClinQueryAgent, a conversational agent that converts natural language queries into database queries for population health management while keeping patient data secure, and reports its use by 128 s...

  19. SLiNT: Structure-aware Language Model with Injection and Contrastive Training for Knowledge Graph Completion

    cs.CL 2025-09 conditional novelty 4.0 of 10

    A structure-injected frozen-LLM framework with contrastive training achieves small gains on WN18RR and FB15k-237 link prediction.

  20. LLMs+Graphs: Toward Graph-Native, Synergistic AI Systems

    cs.DB 2026-06 unverdicted novelty 2.0 of 10

    The paper synthesizes three synergies between LLMs and graphs—augmented retrieval/reasoning, bidirectional KG integration, and graph-enhanced agents—plus LLM uses in graph data management and ML.

Pith tools