palash1992 / GEM-BenchmarkLinks
Benchmark for Graph Embedding Methods
☆48Updated 4 years ago
Alternatives and similar repositories for GEM-Benchmark
Users that are interested in GEM-Benchmark are comparing it to the libraries listed below
Sorting:
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 2 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- tNodeEmbed☆79Updated 2 years ago
- embedding attributed graphs☆57Updated 3 years ago
- Reference implementation of Diffusion2Vec (Complenet 2018) built on Gensim and NetworkX.☆126Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 7 years ago
- A sparsity aware and memory efficient implementation of "Attributed Social Network Embedding" (TKDE 2018).☆82Updated 2 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆134Updated 2 years ago
- Relation learning on content-rich diffusion networks☆12Updated 6 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆87Updated last year
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 years ago
- A curated list of awesome graph representation learning.☆69Updated 4 years ago
- Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data☆46Updated 6 years ago
- ☆39Updated 10 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec☆187Updated 5 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).☆167Updated 2 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆51Updated 2 years ago
- Learning node representation using edge semantics☆53Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 2 years ago
- Implements various negative sampling techniques for learning knowledge graph embeddings☆39Updated 5 years ago
- PPRGo model in PyTorch, as proposed in "Scaling Graph Neural Networks with Approximate PageRank" (KDD 2020)☆126Updated 3 years ago
- This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…☆66Updated last year
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆175Updated 2 years ago
- Code for the AAAI 2018 Paper "HARP: Hierarchical Representation Learning for Networks"☆116Updated 2 years ago