Graph clustering: families, coverage, and design #484
Becheler
started this conversation in
Algorithm Coverage
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Story
DmitriBogdanov listed community detection as the main reason his team did not adopt BGL:
He also provided the clearest taxonomy of the problem space:
Louvain just merged. Leiden is the natural next step in the agglomerative family. SBM is the gap nobody else fills. Spectral methods are the third family and raise a hard design question: they require an eigensolver, which is a full external library dependency. BGL cannot pick one unilaterally: but the backend could be injectable (maybe with a sensible default), following the same pattern as quality functions in Louvain.
Dream solution
Starting point
DmitriBogdanov's comment in discussion #466
Louvain merged PR #453
Leiden paper, Traag et al. 2019
Karrer & Newman 2011, Stochastic Block Models
Von Luxburg 2007, A Tutorial on Spectral Clustering
Spectra, header-only C++ eigensolver, MPL2
Intermediary objective (45 min)
Beta Was this translation helpful? Give feedback.
All reactions