Alternatives and similar repositories for proj-quant-eval

Users that are interested in proj-quant-eval are comparing it to the libraries listed below

• mperrot / ComparisonHC
  Python implementation of several comparison-based hierarchical clustering algorithms.
  ☆7Updated 3 years ago
• IsolationKernel / Codes
  ☆51Updated 5 months ago
• sciai-lab / UMAPs-true-loss
  Uniform Manifold Approximation and Projection
  ☆12Updated 3 years ago
• floklimm / hypergraph
  Library of python functions for the analysis of hypergraphs.
  ☆12Updated 4 months ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 9 months ago
• ngoc-nguyen-0 / DGG
  Linxiao Yang, Ngai-Man Cheung, Jiaying Li, and Jun Fang, "Deep Clustering by Gaussian Mixture Variational Autoencoders with Graph Embeddi…
  ☆53Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• DRLib / CDR
  Implementation of CDR - Interactive Visual Cluster Analysis by Contrastive Dimensionality Reduction
  ☆22Updated 2 years ago
• ChongYou / subspace-clustering
  Toolbox for large scale subspace clustering
  ☆177Updated 3 years ago
• leowyy / GraphTSNE
  PyTorch Implementation of GraphTSNE, ICLR’19
  ☆134Updated 6 years ago
• MysteryVaibhav / RWR-GAE
  Code for the paper "RWR-GAE: Random Walk Regularized Graph Auto Encoder"
  ☆38Updated last year
• lorenzopalloni / wl-graph-kernels
  A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.
  ☆24Updated 5 years ago
• xdxuyang / Deep-Spectral-Clustering-using-Dual-Autoencoder-Network
  ☆56Updated 5 years ago
• amber0309 / HSIC
  Python code of Hilbert-Schmidt Independence Criterion
  ☆87Updated 2 years ago
• lukasjf / contrastive-gnn-explanation
  ☆19Updated 2 years ago
• jiangyangby / DM2C
  ☆12Updated 5 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)
  ☆16Updated 4 years ago
• TrustAGI-Lab / MGAE
  Implementation of the CIKM-17 paper “MGAE: Marginalized Graph Autoencoder for Graph Clustering”
  ☆28Updated 3 years ago
• matthklein / fair_spectral_clustering
  Code for our paper "Guarantees for Spectral Clustering with Fairness Constraints"
  ☆8Updated 6 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• nrkarthikeyan / topology-decision-boundaries
  Topology of decision boundaries
  ☆28Updated 5 years ago
• jwcalder / GraphLearning
  Python package for graph-based clustering and semi-supervised learning
  ☆94Updated 2 months ago
• abojchevski / node_embedding_attack
  Adversarial Attacks on Node Embeddings via Graph Poisoning
  ☆59Updated 5 years ago
• zepx / graphencoder
  Learning Deep Representations for Graph Clustering Implementation
  ☆18Updated 6 years ago
• danielzuegner / gnn-meta-attack
  Implementation of the paper "Adversarial Attacks on Graph Neural Networks via Meta Learning".
  ☆147Updated 3 years ago
• yh-yao / InterpretableClustering
  ☆23Updated last year
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• karenlatong / AGC-master
  ☆51Updated 3 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆100Updated 2 years ago