GiulioRossetti / DEMONLinks
DEMON: a local-first discovery method for overlapping communities.
☆36Updated last year
Alternatives and similar repositories for DEMON
Users that are interested in DEMON are comparing it to the libraries listed below
Sorting:
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- ☆51Updated 9 years ago
- Python wrapper for the Kavosh network motif finder☆52Updated 11 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆107Updated this week
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆29Updated 4 years ago
- TILES: an algorithm for community discovery in dynamic social networks☆60Updated last year
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 3 years ago
- ☆144Updated 4 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆178Updated 2 years ago
- SNAP Python code, SWIG related files☆306Updated 3 years ago
- A novel approach to evaluate community detection algorithms on ground truth☆22Updated 4 years ago
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆87Updated 2 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆120Updated 3 years ago
- A sparsity aware and memory efficient implementation of "Attributed Social Network Embedding" (TKDE 2018).☆82Updated 3 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 8 years ago
- Community Detection in Graphs (master's degree short project)☆39Updated 3 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- Implementation of "Overlapping Community Detection with Graph Neural Networks"☆171Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 3 years ago
- GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…☆65Updated 4 years ago
- Easy link prediction tool☆142Updated last year
- ☆173Updated 7 years ago
- A SciPy implementation of "GraRep: Learning Graph Representations with Global Structural Information" (WWW 2015).☆65Updated 3 years ago
- A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…☆94Updated 7 years ago
- Community Discovery Library☆412Updated 2 months ago