vermaMachineLearning / FGSDLinks
Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
☆24Updated 5 years ago
Alternatives and similar repositories for FGSD
Users that are interested in FGSD are comparing it to the libraries listed below
Sorting:
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆62Updated 4 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 7 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- A convolutional neural network for graph classification in PyTorch☆91Updated 6 years ago
- mixed membership stochastic block model☆13Updated 9 years ago
- Graph kernels☆55Updated last month
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- TensorFlow implementation of Deep Graph Infomax☆62Updated 7 years ago
- ☆35Updated 6 years ago
- ☆12Updated 4 years ago
- Learning neural network embeddings in hyperbolic spaces☆14Updated 6 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 7 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- LDP for graph classification☆23Updated 6 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆43Updated 2 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- A comprehensive collection of GNN works in NeurIPS 2019.☆21Updated 6 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 6 years ago
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Updated 5 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆178Updated 2 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆53Updated 5 years ago
- OhmNet: Representation learning in multi-layer graphs☆84Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 3 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- ☆12Updated 5 years ago
- Benchmark for Graph Embedding Methods☆48Updated 5 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆86Updated last year