Probabilistic-Graph-Clustering Imanm02 · COMPLETED
Graph clustering derived from probabilistic models and implemented in NumPy: BigCLAM affiliation likelihood, stochastic block model label search, spectral and Fiedler clustering, random-walk merging, plus Erdos-Renyi simulations.
github.com/Imanm02/Probabilistic-Graph-Clustering · ★ 1 · Forks 0 · Size 5.5 MB
SUMMARY
Technologies 4
Scored 4
Observed 4
Practices 6
Evidence 4
Skips 0
COVERAGE
Analyzed 117 files · 15 commits · 0 API calls
TECHNOLOGIES & DEPTH
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
Python LANGUAGE Depth 70
29 files · PRODUCTION
NumPy LIBRARY Depth 74
9 files · PRODUCTION
pandas LIBRARY Depth 58
1 files · PRODUCTION
PRACTICES
documentation · observedautomated_tests · absentcontinuous_integration · absentcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2023-02-07
Last commit 2026-09-20
Active months 4
Commits 15