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:
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…☆9Updated 15 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs☆27Updated 3 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 8 years ago
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Contrast Subgraph Mining from Coherent Cores☆14Updated 7 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
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated last month
- Distributed Graph Mining on a Massive "Single" Graph☆16Updated 5 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- ☆8Updated 8 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- ☆51Updated 8 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- A CUDA-based multi-GPU vertex-centric graph processing framework based on Warp Segmentation and Vertex Refinement techniques.☆11Updated 8 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 9 months ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- GossipMap: distributed parallel community detection algorithm☆22Updated 9 years ago