# ProjE: Embedding Projection for Knowledge Graph Completion

arXiv: https://arxiv.org/abs/1611.05425 · HTML: https://mlsanity.com/paper/1611.05425/

## Key facts

- Cited by 26 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Nov 2016.

## Built on by (most cited first, 26 of 26)

- [Recent Advances in Deep Learning Based Dialogue Systems: A Systematic Survey](https://mlsanity.com/paper/2105.04387/) (2021)
- [A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal](https://mlsanity.com/paper/2212.05767/) (2022)
- [A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation](https://mlsanity.com/paper/2402.03358/) (2024)
- [Link Prediction on N-ary Relational Data Based on Relatedness Evaluation](https://mlsanity.com/paper/2104.10424/) (2021)
- [Multimodal Learning on Graphs for Disease Relation Extraction](https://mlsanity.com/paper/2203.08893/) (2022)
- [Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models](https://mlsanity.com/paper/2302.06229/) (2023)
- [HEAT: Hyperedge Attention Networks](https://mlsanity.com/paper/2201.12113/) (2022)
- [Neural Graph Databases](https://mlsanity.com/paper/2209.09732/) (2022)
- [Large Language Model Enhanced Knowledge Representation Learning: A Survey](https://mlsanity.com/paper/2407.00936/) (2024)
- [A shallow neural model for relation prediction](https://mlsanity.com/paper/2101.09090/) (2021)
- [Bridging the User-side Knowledge Gap in Knowledge-aware Recommendations with Large Language Models](https://mlsanity.com/paper/2412.13544/) (2024)
- [Triple Classification for Scholarly Knowledge Graph Completion](https://mlsanity.com/paper/2111.11845/) (2021)
- [Joint Pre-training and Local Re-training: Transferable Representation Learning on Multi-source Knowledge Graphs](https://mlsanity.com/paper/2306.02679/) (2023)
- [Integrating Approaches to Word Representation](https://mlsanity.com/paper/2109.04876/) (2021)
- [μKG: A Library for Multi-source Knowledge Graph Embeddings and Applications](https://mlsanity.com/paper/2207.11442/) (2022)
- [Fact-Checking Generative AI: Ontology-Driven Biological Graphs for Disease-Gene Link Verification](https://mlsanity.com/paper/2308.03929/) (2023)
- [On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion](https://mlsanity.com/paper/2504.08970/) (2025)
- [Knowledge Graph Refinement based on Triplet BERT-Networks](https://mlsanity.com/paper/2211.10460/) (2022)
- [Knowledge Reasoning via Jointly Modeling Knowledge Graphs and Soft Rules](https://mlsanity.com/paper/2301.02781/) (2023)
- [Gene-Metabolite Association Prediction with Interactive Knowledge Transfer Enhanced Graph for Metabolite Production](https://mlsanity.com/paper/2410.18475/) (2024)
- [Taxonomy Enrichment with Text and Graph Vector Representations](https://mlsanity.com/paper/2201.08598/) (2022)
- [ProjB: An Improved Bilinear Biased ProjE model for Knowledge Graph Completion](https://mlsanity.com/paper/2209.02390/) (2022)
- [EventEA: Benchmarking Entity Alignment for Event-centric Knowledge Graphs](https://mlsanity.com/paper/2211.02817/) (2022)
- [Farspredict: A benchmark dataset for link prediction](https://mlsanity.com/paper/2303.14647/) (2023)
- [Knowledge-Aware Neuron Interpretation for Scene Classification](https://mlsanity.com/paper/2401.15820/) (2024)
- [Higher-Order Graph Databases](https://mlsanity.com/paper/2506.19661/) (2025)

## Abstract (arXiv)

With the large volume of new information created every day, determining the validity of information in a knowledge graph and filling in its missing parts are crucial tasks for many researchers and practitioners. To address this challenge, a number of knowledge graph completion methods have been developed using low-dimensional graph embeddings. Although researchers continue to improve these models using an increasingly complex feature space, we show that simple changes in the architecture of the underlying model can outperform state-of-the-art models without the need for complex feature engineering. In this work, we present a shared variable neural network model called ProjE that fills-in missing information in a knowledge graph by learning joint embeddings of the knowledge graph's entities and edges, and through subtle, but important, changes to the standard loss function. In doing so, ProjE has a parameter size that is smaller than 11 out of 15 existing methods while performing 37% better than the current-best method on standard datasets. We also show, via a new fact checking task, that ProjE is capable of accurately determining the veracity of many declarative statements.
