xgfs / NetLSDLinks
NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
☆60Updated 5 years ago
Alternatives and similar repositories for NetLSD
Users that are interested in NetLSD are comparing it to the libraries listed below
Sorting:
- A package for computing Graph Kernels☆104Updated 2 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆131Updated 4 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 2 months ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- ☆143Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 11 months ago
- ☆173Updated 6 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Benchmark for Graph Embedding Methods☆48Updated 4 years ago
- A graph matching library for Python☆207Updated last year
- Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018☆28Updated 4 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
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆87Updated last year
- Graph Embedding via Frequent Subgraphs☆45Updated 5 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆175Updated 2 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
- This repository contains the "tensorflow" implementation of our paper "graph2vec: Learning distributed representations of graphs".☆157Updated 7 years ago
- An implementation of "Community Preserving Network Embedding" (AAAI 2017)☆121Updated 2 years ago
- Hierarchical graph clustering☆38Updated 7 years ago
- Source code from the NeurIPS 2019 workshop article "Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks" (G. Salha, R…☆133Updated 4 years ago
- This repository contains the TensorFlow implemtation of subgraph2vec (KDD MLG 2016) paper☆26Updated 7 years ago
- A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).☆290Updated 3 years ago
- A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".☆187Updated 2 years ago
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 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
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- [DSAA 2018] Autoencoders for Link Prediction and Semi-Supervised Node Classification☆255Updated 6 years ago
- A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…☆94Updated 6 years ago