palash1992 / GEM-BenchmarkLinks
Benchmark for Graph Embedding Methods
☆48Updated 5 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 4 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 8 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆108Updated last month
- Reference implementation of Diffusion2Vec (Complenet 2018) built on Gensim and NetworkX.☆127Updated 3 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 3 years ago
- Easy link prediction tool☆142Updated last year
- tNodeEmbed☆79Updated 2 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 3 years ago
- ☆173Updated 7 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 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
- A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).☆167Updated 3 years ago
- Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data☆46Updated 6 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆89Updated last year
- OhmNet: Representation learning in multi-layer graphs☆84Updated 5 years ago
- embedding attributed graphs☆57Updated 4 years ago
- A curated list of awesome graph representation learning.☆70Updated 5 years ago
- ☆39Updated 10 years ago
- A sparsity aware and memory efficient implementation of "Attributed Social Network Embedding" (TKDE 2018).☆82Updated 3 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- ☆144Updated 4 years ago
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec☆186Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".☆189Updated 2 years ago
- Learning node representation using edge semantics☆54Updated 6 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆126Updated 3 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆178Updated 2 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆97Updated 4 years ago