A knowledge graph stores facts as connections: Paris — capital of — France. That structure is wonderful for humans and awkward for machine learning, which prefers numbers. Knowledge graph embeddings are the bridge — they turn the entities and relationships of a graph into vectors a model can compute with, while keeping the meaning of the connections intact.
First, the graph
A knowledge graph is built from triples — (head, relation, tail). Each triple is a fact, and the graph is the web of all of them. The power is in the structure: you can traverse it, reason over it, and ask questions that span many hops.
What embeddings add
An embedding places every entity and relation as a point in a continuous space, positioned so that the geometry reflects the facts. Done well, the model can score whether a new triple is likely true — predicting links the graph never explicitly stated.
How the models work
- TransE — treats a relation as a translation: head + relation ≈ tail.
- DistMult — scores a triple by a multiplicative interaction between vectors.
- ComplEx — uses complex-valued vectors to capture asymmetric relations.
- Graph neural networks — learn embeddings from each node’s neighbourhood.
Why it matters
- Link prediction — suggesting facts and connections that are missing.
- Recommendation — finding entities that are “near” in meaning, not just co-occurrence.
- Question answering — grounding an LLM in structured, verifiable relationships.
“Embeddings let a machine do with a knowledge graph what people do instinctively: reason about a fact it was never told.”
KnackLabs
