conradlee / network-community-benchmark
For benchmaring community detection algorithms on social networks with meta-data
☆17Updated 10 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
- Dynamic Community Finding☆26Updated 7 years ago
- Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…☆9Updated 14 years ago
- GossipMap: distributed parallel community detection algorithm☆22Updated 9 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- ☆51Updated 8 years ago
- A Gephi plugin for community detection in dynamic networks☆12Updated 11 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 5 months ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆39Updated 7 years ago
- Market Survey: Community Detection☆70Updated 7 years ago
- ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks☆11Updated 8 years ago
- ☆30Updated 7 years ago
- Source Code of GraRep☆52Updated 7 years ago
- Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…☆74Updated 4 years ago
- Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"☆35Updated 10 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☆87Updated 6 years ago
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- MPI based distributed memory implementation of Louvain method for non overlapping community detecction☆28Updated 10 years ago
- ☆8Updated 8 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- Network Representation Learning with Rich Text Information (IJCAI 2015)☆47Updated 7 years ago
- Benchmarking various graph databases, engines, datastructures, and data stores.☆36Updated 11 years ago
- Graph kernels☆56Updated 3 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- DeepWalk implementation in C++☆99Updated 10 months 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
- Community Detection and Compression Analytic for Big Graph Data☆37Updated 10 years ago
- Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman☆49Updated 3 months ago