GiulioRossetti / DEMONLinks
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
Sorting:
- Python wrapper for the Kavosh network motif finder☆52Updated 10 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- TILES: an algorithm for community discovery in dynamic social networks☆59Updated last year
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 2 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- Hypergraph Algorithms Package☆98Updated 2 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- node2vec implementation in C++☆52Updated 5 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- Omega Index for evaluation of overlapping community structure - (Python package available through pip)☆12Updated 3 years ago
- An implementation of "Network Representation Learning with Rich Text Information" (IJCAI '15).☆61Updated 2 years ago
- Graph Embedding via Frequent Subgraphs☆45Updated 5 years ago
- ☆143Updated 4 years ago
- A SciPy implementation of "GraRep: Learning Graph Representations with Global Structural Information" (WWW 2015).☆65Updated 2 years ago
- Easy link prediction tool☆142Updated 7 months ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…☆94Updated 6 years ago
- A sparsity aware and memory efficient implementation of "Attributed Social Network Embedding" (TKDE 2018).☆82Updated 2 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 2 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Fast consensus clustering in networks☆22Updated 10 months ago
- Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks (TKDD 2019)☆18Updated 3 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- community detection for the whole Twitter graph on a single laptop☆21Updated 7 years ago
- A lightweight implementation of Walklets from "Don't Walk Skip! Online Learning of Multi-scale Network Embeddings" (ASONAM 2017).☆105Updated 2 years ago
- Community detection using attribute and structural similarities.☆14Updated 7 years ago
- Implements the bigCLAM algorithm☆51Updated 5 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆29Updated 3 years ago