conradlee / network-community-benchmarkLinks
For benchmaring community detection algorithms on social networks with meta-data
☆17Updated 11 years ago
Alternatives and similar repositories for network-community-benchmark
Users that are interested in network-community-benchmark are comparing it to the libraries listed below
Sorting:
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 10 months ago
- Dynamic Community Finding☆26Updated 7 years ago
- Market Survey: Community Detection☆70Updated 8 years ago
- GossipMap: distributed parallel community detection algorithm☆22Updated 10 years ago
- ☆51Updated 8 years ago
- Scalable Graph Mining☆63Updated 2 years ago
- ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks☆11Updated 8 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Community Detection and Compression Analytic for Big Graph Data☆37Updated 11 years ago
- Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs☆27Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- MPI based distributed memory implementation of Louvain method for non overlapping community detecction☆28Updated 11 years ago
- ☆30Updated 8 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 7 years ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Updated 10 years ago
- A Gephi plugin for community detection in dynamic networks☆12Updated 11 years ago
- A graph processing engine for hybrid CPU and GPU platforms☆38Updated 6 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- We design a Monte Carlo based method, UniWalk, to enable the fast top-k SimRank computation over large undirected graphs. UniWalk directl…☆12Updated 7 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆40Updated 7 years ago
- Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman☆50Updated 8 months ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆53Updated 9 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"☆36Updated 11 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆42Updated 7 years ago
- ☆11Updated 9 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 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…☆116Updated last year
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago