eXascaleInfolab / GenConvNMILinks
Generalized Conventional Mutual Information (GenConvMI) - NMI for overlapping (soft, fuzzy) clusters (communities), compatible with standard NMI, pure C++ version (single executable)
☆21Updated 5 years ago
Alternatives and similar repositories for GenConvNMI
Users that are interested in GenConvNMI are comparing it to the libraries listed below
Sorting:
- Extremely fast evaluation of the extrinsic clustering measures: various (mean) F1 measures and Omega Index (Fuzzy Adjusted Rand Index) fo…☆22Updated 4 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 7 years ago
- ☆51Updated 9 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- Clubmark: a Parallel Isolation Framework for Benchmarking and Profiling of Clustering (Community Detection) Algorithms Considering Overla…☆23Updated 4 years ago
- ☆144Updated 4 years ago
- Graph kernels☆55Updated last month
- mixed membership stochastic block model☆13Updated 9 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- A package for computing Graph Kernels☆103Updated 2 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Codes for TopPPR☆14Updated 6 years ago
- Overlapping Normalized Mutual Information and Omega Index evaluation for the overlapping community structure produced by clustering algor…☆16Updated 6 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 7 years ago
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆87Updated 2 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Implements the bigCLAM algorithm☆51Updated 6 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 3 years ago
- A package for computing Graph Kernels☆33Updated 7 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
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 7 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆62Updated 4 years ago
- This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).☆38Updated 6 years ago
- OhmNet: Representation learning in multi-layer graphs☆84Updated 5 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Updated 5 years ago
- Python wrapper for the Kavosh network motif finder☆52Updated 11 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆61Updated 5 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated last year
- Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…☆73Updated 5 years ago