Alternatives and similar repositories for topo-clustering

Users that are interested in topo-clustering are comparing it to the libraries listed below

• Mishne-Lab / IGNR
  Implementation of Implicit Graphon Neural Representation
  ☆12Updated 2 years ago
• pietrobarbiero / entropy-lens
  ☆17Updated 2 years ago
• geon0325 / Set2Box
  Source code for ICDM 2022 paper "Set2Box: Similarity Preserving Representation Learning for Sets."
  ☆14Updated 2 years ago
• xiongbo010 / QGCN
  PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))
  ☆17Updated last year
• tlacombe / topologicalUncertainty
  ☆11Updated 3 years ago
• ggoh29 / Simplicial-neural-network-benchmark
  Simplicial neural network benchmarking software
  ☆17Updated 3 years ago
• ansonb / FeTA_TMLR
  This repository reproduces the results in the paper "How expressive are transformers in spectral domain for graphs?"(published in TMLR)
  ☆12Updated 3 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• BorgwardtLab / fisher_information_embedding
  Official code for Fisher information embedding for node and graph learning (ICML 2023)
  ☆19Updated 2 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• HongtengXu / SGWB-Graphon
  Learning Graphons via Structured Gromov-Wasserstein Barycenters
  ☆22Updated 4 years ago
• TAU-MLwell / Set-Tree
  Official repository for the paper: "Trees with Attention for Set Prediction Tasks" (ICML21)
  ☆10Updated 3 years ago
• young917 / MiDaS
  WWW22 - MiDaS: Representative Hypergraph Sampling
  ☆12Updated last year
• Pseudomanifold / pyper
  Python-based persistent homology algorithms
  ☆19Updated 2 years ago
• Hermina / fGOT
  Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"
  ☆15Updated 2 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆24Updated 3 years ago
• lrnzgiusti / can
  Official repository for Cell Attention Networks
  ☆14Updated last year
• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆22Updated 5 years ago
• PurdueMINDS / size-invariant-GNNs
  Size-Invariant Graph Representations for Graph Classification Extrapolations (ICML 2021 Long Talk)
  ☆23Updated 2 years ago
• ZZYSonny / PlanE
  Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs…
  ☆14Updated last year
• ahmedmalaa / evaluating-generative-models
  ☆21Updated 2 years ago
• ispamm / MATE
  MetA-Train to Explain
  ☆18Updated 3 years ago
• LFhase / GMT
  [ICML 2024] How Interpretable Are Interpretable Graph Neural Networks?
  ☆14Updated last year
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• kilianhae / discrete_DPPM_Graphs
  Diffusion Models for Graphs Benefit From Discrete State Spaces
  ☆34Updated 2 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆42Updated last year
• RingBDStack / PASTEL
  Code for "Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing"
  ☆15Updated last year
• lrnzgiusti / on-oversquashing
  Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)
  ☆15Updated last year
• EDAPINENUT / GNTPP
  This is the official codebase of `Exploring Generative Neural Temporal Point Process' (Accepted by TMLR).
  ☆19Updated 2 years ago