mperrot / ComparisonHC

Related projects: ⓘ

• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆100Updated 4 years ago
• yincheng / GGP
  Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'
  ☆38Updated 5 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆95Updated last year
• aburnap / Mixed-Membership-Stochastic-Blockmodel
  Mixed Membership Stochastic Blockmodel Implementation with 3 Inference Schemes
  ☆24Updated 9 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆56Updated 5 years ago
• amber0309 / HSIC
  Python code of Hilbert-Schmidt Independence Criterion
  ☆77Updated 2 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆30Updated 3 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• rmgarnett / fast_wl
  A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
  ☆11Updated 6 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 4 years ago
• HazyResearch / HypHC
  Hyperbolic Hierarchical Clustering.
  ☆190Updated 11 months ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆82Updated 6 years ago
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆60Updated 3 years ago
• matthklein / fair_spectral_clustering
  Code for our paper "Guarantees for Spectral Clustering with Fairness Constraints"
  ☆9Updated 5 years ago
• yhenon / pyrcc
  Python implementation of Robust Continuous Clustering
  ☆101Updated 5 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 4 years ago
• Biwei-Huang / Generalized-Score-Functions-for-Causal-Discovery
  A generalized score-based method for Causal Discovery
  ☆15Updated 3 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆77Updated 2 weeks ago
• sharpenb / Differentiable-DAG-Sampling
  Differentiable DAG Sampling (ICLR 2022)
  ☆35Updated 2 years ago
• eugenium / LearnGraphDiscovery
  Learnable Graph Discovery
  ☆10Updated 5 years ago
• lttam / TreeWasserstein
  Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…
  ☆12Updated 4 years ago
• 000Justin000 / ssl_edge
  Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"
  ☆15Updated 5 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆40Updated 5 years ago
• markvdw / GPflow-inter-domain
  Gaussian processes in TensorFlow with modifications to allow inter-domain inducing variables
  ☆13Updated 7 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆43Updated last year
• alelab-upenn / graph-scattering-transforms
  Code for experimentation on graph scattering transforms
  ☆26Updated 4 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆15Updated 4 years ago
• dongwookim-ml / MMSB
  mixed membership stochastic block model
  ☆13Updated 8 years ago
• muhanzhang / D-VAE
  D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019
  ☆125Updated 3 years ago