xgfs / NetLSD
NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
☆59Updated 5 years ago
Alternatives and similar repositories for NetLSD:
Users that are interested in NetLSD are comparing it to the libraries listed below
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆130Updated 4 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 6 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 6 months ago
- A package for computing Graph Kernels☆104Updated last year
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆124Updated last year
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 3 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated 11 months ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 2 years ago
- Comparative metrics for dynamic networks in Python☆68Updated 2 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆86Updated 8 months ago
- This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper☆26Updated 7 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆50Updated 2 years ago
- Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018☆26Updated 4 years ago
- Source code from the NeurIPS 2019 workshop article "Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks" (G. Salha, R…☆132Updated 4 years ago
- Python implementation of Kohler et al.'s random walk with restart☆29Updated 6 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆174Updated last year
- Fast (Personalized) PageRank Implementation☆65Updated last year
- Graph Embedding via Frequent Subgraphs☆44Updated 4 years ago
- ☆172Updated 6 years ago
- node2vec implementation in C++☆53Updated 4 years ago
- Implements the bigCLAM algorithm☆51Updated 5 years ago
- OhmNet: Representation learning in multi-layer graphs☆82Updated 4 years ago
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆89Updated 5 years ago
- ☆137Updated 4 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆132Updated 2 years ago