GemsLab / VoG_Graph_Summarization
Summarization of static graphs using the Minimum Description Length principle
☆27Updated 9 years ago
Alternatives and similar repositories for VoG_Graph_Summarization
Users that are interested in VoG_Graph_Summarization are comparing it to the libraries listed below
Sorting:
- Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…☆74Updated 4 years ago
- ☆172Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- Graph kernels☆56Updated 3 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 years ago
- Community Detection Research Effort☆79Updated 9 years ago
- node2vec implementation in C++☆52Updated 4 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- Scalable tensor factorization☆54Updated 9 years ago
- Bayesian Poisson tensor factorization☆58Updated 6 months ago
- ☆51Updated 8 years ago
- Contains the code (and working vm setup) for our KDD MLG 2016 paper titled: "subgraph2vec: Learning Distributed Representations of Rooted…☆42Updated 8 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- Source Code of GraRep☆52Updated 7 years ago
- Python implementation of Kohler et al.'s random walk with restart☆29Updated 6 years ago
- ☆13Updated 9 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 6 years ago
- MLSS 2016 material.☆22Updated 8 years ago
- Fitting stochastic blockmodels to graphs☆17Updated 8 years ago
- Network Embedding Survey and Resources☆40Updated 8 years ago
- Bayesian or-of-and☆34Updated 3 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- Material for the EPFL master course "A Network Tour of Data Science", edition 2016.☆98Updated 4 years ago
- This toolkit consists of implementations of various graph-based semi-supervised learning (SSL) algorithms. Currently, three algorithms ar…☆151Updated 7 years ago
- Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.☆26Updated 4 years ago
- Experimentation code for the article "Building Topic Models Based on Anchor Words" based on the paper "Learning Topic Models: Going beyon…☆15Updated 11 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 7 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆59Updated 5 years ago