community detection
An algorithmic process that clusters related nodes in a graph into hierarchical groups (communities) at varying levels of granularity.
As defined in Knowledge Graph or Vector Database… Which is Better?
Other definitions
The task of grouping similar or densely-connected nodes in a network into communities according to some objective function.
301 | Tina Eliassi-Rad on Al, Networks, and Epistemic InstabilityAn algorithmic process for identifying and clustering related entities and relationships into hierarchical groups or communities at different levels of granularity, enabling multi-scale organization of graph data.
Knowledge Graph or Vector Database… Which is Better?
Where it comes up · 2
- Knowledge Graph or Vector Database… Which is Better?3 claims
- 301 | Tina Eliassi-Rad on Al, Networks, and Epistemic Instability1 claim
Most important claims · 4 of 4Search all claims for “community detection” →
- Aaron Clauset, Leto Peel and colleagues proved a no-free-lunch theorem for community detection: there is no single grouping of nodes that constitutes the one true or best community structure, because no single objective-function peak exists, so a node cannot be definitively assigned to one community.301 | Tina Eliassi-Rad on Al, Networks, and Epistemic Instability
- GraphRAG's indexing data flow loads and splits text into chunks, extracts entities and relationships with an LLM per chunk, merges and summarizes the per-chunk subgraphs, creates embeddings for the nodes, performs community detection, and then generates Community Reports (summaries of information within communities) which are also embedded.Knowledge Graph or Vector Database… Which is Better?
- The three main components of knowledge graphs in GraphRAG are entities (distinct objects/persons/places/events/concepts extracted from text chunks, forming nodes), relationships (connections between entities, also extracted by LLM analysis), and communities (clusters of related entities identified through hierarchical community detection, typically the Leiden algorithm).Knowledge Graph or Vector Database… Which is Better?
- The Leiden algorithm is used for hierarchical community detection in knowledge graphs to create multiple levels of community groupings, with more specific communities at lower levels and broader communities at higher levels, allowing for multi-scale navigation of the graph.Knowledge Graph or Vector Database… Which is Better?