Why graphs over vector embeddings

In the previous lesson, you learned how the POLE+O model classifies entities and how relationshipsiFull definition for relationship (opens in a new tab)A named, directed connection between two nodes. Every relationship has a type, a start node and an end node. carry temporal validity. You might ask: why not rely on vector embeddingsiFull definition for embedding (opens in a new tab)Information represented as a numerical vector, positioned so that similar information sits close together. alone for long-term agent memory?

In this lesson, you will learn what vector embeddings can and cannot do — and why multi-hop graph traversaliFull definition for traversal (opens in a new tab)Following relationships from one node to the next to reach other parts of a graph. answers questions that embeddings alone cannot.