rabbanyk / CommunityEvaluationLinks
A framework for evaluating community mining algorithms.
☆11Updated 9 years ago
Alternatives and similar repositories for CommunityEvaluation
Users that are interested in CommunityEvaluation are comparing it to the libraries listed below
Sorting:
- The implementation for maximum clique enumeration algorithm☆11Updated 9 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 8 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆11Updated 9 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- ☆30Updated 8 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Contrast Subgraph Mining from Coherent Cores☆13Updated 7 years ago
- A C++ implementation of E2LSH and C2LSH☆9Updated 8 years ago
- Library of graph algorithms for Apache Giraph.☆8Updated 9 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 8 months ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- A streaming algorithm for graph clustering☆12Updated 7 years ago
- MPI based algorithm for detecting high centrality vertices in large graphs☆8Updated 11 years ago
- A scalable distributed graph partitioner. Ongoing research.☆15Updated 8 years ago
- ☆8Updated 8 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆23Updated 11 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆8Updated 9 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆40Updated 2 weeks ago
- Analysis of large complex network collections – part of the KONECT project by Jérôme Kunegis, University of Namur☆7Updated 2 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago
- ☆15Updated 8 years ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Updated 14 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆114Updated last year
- Alchemist: an Apache Spark<->MPI interface☆26Updated 7 years ago
- ICSE'18: Tuning Smote☆11Updated 6 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