nkahmed / PGD
A Parallel Graphlet Decomposition Library for Large Graphs
☆87Updated 6 years ago
Alternatives and similar repositories for PGD:
Users that are interested in PGD are comparing it to the libraries listed below
- ☆137Updated 4 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆161Updated 4 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆130Updated 4 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 6 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆86Updated 9 months ago
- A package for computing Graph Kernels☆104Updated last year
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆174Updated last year
- ORbit Counting Algorithm☆38Updated 8 years ago
- ☆172Updated 6 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"☆17Updated last year
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- ☆52Updated 8 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆28Updated 3 years ago
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec☆187Updated 5 years ago
- ☆350Updated 5 years ago
- GloDyNE: Global Topology Preserving Dynamic Network Embedding (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/930271…☆65Updated 3 years ago
- Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"☆116Updated last year
- ☆16Updated 7 years ago
- tNodeEmbed☆79Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆41Updated 6 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 6 years ago
- ☆11Updated 7 years ago
- ☆13Updated 8 years ago
- Discovering Polarized Communities in Signed Networks☆13Updated 5 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year