nphdang / GE-FSGLinks
Graph Embedding via Frequent Subgraphs
☆45Updated 5 years ago
Alternatives and similar repositories for GE-FSG
Users that are interested in GE-FSG are comparing it to the libraries listed below
Sorting:
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 2 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
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆120Updated 2 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- Reference implementation of Diffusion2Vec (Complenet 2018) built on Gensim and NetworkX.☆126Updated 2 years ago
- Graph similarity algorithms based on NetworkX.☆170Updated 6 years ago
- ☆173Updated 6 years ago
- [DSAA 2018] Autoencoders for Link Prediction and Semi-Supervised Node Classification☆255Updated 6 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- A sparsity aware and memory efficient implementation of "Attributed Social Network Embedding" (TKDE 2018).☆82Updated 2 years ago
- This repository contains the "tensorflow" implementation of our paper "graph2vec: Learning distributed representations of graphs".☆157Updated 7 years ago
- The TensorFlow reference implementation of 'GEMSEC: Graph Embedding with Self Clustering' (ASONAM 2019).☆259Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 2 years ago
- A SciPy implementation of "GraRep: Learning Graph Representations with Global Structural Information" (WWW 2015).☆65Updated 2 years ago
- A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".☆187Updated 2 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- A curated list of awesome graph representation learning.☆69Updated 4 years ago
- A sparsity aware implementation of "Binarized Attributed Network Embedding" (ICDM 2018).☆88Updated 2 years ago
- A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).☆167Updated 2 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆88Updated last year
- A lightweight implementation of Walklets from "Don't Walk Skip! Online Learning of Multi-scale Network Embeddings" (ASONAM 2017).☆105Updated 2 years ago
- Deep Graph Kernels☆13Updated 9 years ago
- A PyTorch Implementation of "Watch Your Step: Learning Node Embeddings via Graph Attention" (NeurIPS 2018).☆325Updated 2 years ago
- Easy link prediction tool☆142Updated 10 months ago
- A Pytorch implementation of "Splitter: Learning Node Representations that Capture Multiple Social Contexts" (WWW 2019).☆212Updated 2 years ago
- The reference implementation of "Multi-scale Attributed Node Embedding". (Journal of Complex Networks 2021)☆177Updated 3 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago