jovo / FastApproximateQAPLinks
Fast Approximate Quadratic Assignment for (Brain) Graph Matching
☆16Updated 8 years ago
Alternatives and similar repositories for FastApproximateQAP
Users that are interested in FastApproximateQAP are comparing it to the libraries listed below
Sorting:
- ☆12Updated 4 years ago
- ☆51Updated 10 months ago
- Anonymous Repository for ICML LRG Workshop: On Explainability Techniques for Graph Convolutional Networks☆23Updated 6 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- SetToGraph paper repository☆22Updated 4 years ago
- Sample pytorch implementation of Covariant Compositional Networks☆13Updated 7 years ago
- Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks☆13Updated 4 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- The code repository for Discovering Conflicting Groups in Signed Networks (NeurIPS 2020)☆15Updated 3 years ago
- Code for paper: Neural Architecture Search in Graph Neural Networks (BRACIS 2020)☆18Updated last year
- Code for "Modeling Sparse Deviations for Compressed Sensing using Generative Models", ICML 2018☆24Updated 6 years ago
- Reproduction work of "Neural Relational Inference for Interacting Systems" in Chainer☆33Updated 6 years ago
- MATLAB code for Stein Point Markov Chain Monte Carlo.☆13Updated 5 years ago
- Pytorch implementation for "Particle Flow Bayes' Rule"☆14Updated 5 years ago
- Code for "Deep Convolutional Networks as shallow Gaussian Processes"☆16Updated 5 years ago
- ☆25Updated 6 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Topology of decision boundaries☆28Updated 5 years ago
- A Random Matrix Approach to Extreme Learning Machine☆14Updated 7 years ago
- ☆22Updated 2 years ago
- The Shape of Data: Intrinsic Distance for Comparing Data Distributions☆12Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Change Detection in Graph Streams by Learning Graph Embeddings on Constant-Curvature Manifolds (2018, https://arxiv.org/abs/1805.06299)☆11Updated 5 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆19Updated 5 years ago
- A clean TensorFlow implementation of Concrete Dropout☆22Updated 7 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 5 years ago
- ☆26Updated 6 years ago
- Slides and notebooks for the IfI Summer School 2018 on Machine Learning☆36Updated 6 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago