GiulioRossetti / DEMON
DEMON: a local-first discovery method for overlapping communities.
☆35Updated last year
Alternatives and similar repositories for DEMON:
Users that are interested in DEMON are comparing it to the libraries listed below
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- ☆51Updated 8 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- A novel approach to evaluate community detection algorithms on ground truth☆22Updated 3 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 2 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- TILES: an algorithm for community discovery in dynamic social networks☆59Updated last year
- Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks (TKDD 2019)☆18Updated 3 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆28Updated 3 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 2 years ago
- An implementation of "Network Representation Learning with Rich Text Information" (IJCAI '15).☆60Updated 2 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- ☆138Updated 4 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆124Updated 2 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Algorithms for local community detection in networks☆26Updated 8 years ago
- Python wrapper for the Kavosh network motif finder☆51Updated 10 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆174Updated last year
- Easy link prediction tool☆142Updated 5 months ago
- Community Detection in Graphs (master's degree short project)☆40Updated 2 years ago
- embedding attributed graphs☆57Updated 3 years ago
- A sparsity aware and memory efficient implementation of "Attributed Social Network Embedding" (TKDE 2018).☆82Updated 2 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- Inner product natural graph factorization machine used in 'GEMSEC: Graph Embedding with Self Clustering' .☆11Updated 2 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆86Updated 9 months ago
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆84Updated last year
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 6 months ago
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago