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.

factualpending

Speaker

Adam Lucik

Evidence Quote

“what it's going to try and do is put similar nodes together into these communities at different levels of granularity so in this simple diagram for a level one Community detection what we might see is all of our nodes that are nicely connected will algorithmically move the similar nodes closer together and then we can Define these level one communities and then once we aggregate all of these into larger groupings of nodes we can create a higher up community”

Source

Knowledge Graph or Vector Database… Which is Better?— Adam Lucek
Created: 8/11/2026, 7:35:39 AM

Your notes

Loading notes...