Alternatives and similar repositories for ComparisonHC

Users that are interested in ComparisonHC are comparing it to the libraries listed below

• lttam / TreeWasserstein
  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
• talwagner / fair_clustering
  ☆20Updated 6 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆100Updated 2 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 4 years ago
• aburnap / Mixed-Membership-Stochastic-Blockmodel
  Mixed Membership Stochastic Blockmodel Implementation with 3 Inference Schemes
  ☆24Updated 9 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 years ago
• matthklein / fair_spectral_clustering
  Code for our paper "Guarantees for Spectral Clustering with Fairness Constraints"
  ☆8Updated 5 years ago
• rsonthal / TreeRep
  Learning Tree structures and Tree metrics
  ☆23Updated 9 months ago
• smatsus / S5C
  Selective Sampling-based Scalable Sparse Subspace Clustering (NeurIPS 19')
  ☆13Updated 4 years ago
• yincheng / GGP
  Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'
  ☆38Updated 6 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• HazyResearch / HoroPCA
  Hyperbolic PCA via Horospherical Projections
  ☆71Updated last year
• nmonath / scc
  ☆14Updated 3 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• jwcalder / GraphLearning
  Python package for graph-based clustering and semi-supervised learning
  ☆94Updated 2 months ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 5 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆59Updated 5 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 6 years ago
• wittawatj / fsic-test
  ICML 2017. Kernel-based adaptive linear-time independence test.
  ☆16Updated 3 years ago
• davidhallac / TVGL
  ☆55Updated 7 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• kfoynt / LocalGraphClustering
  ☆138Updated 4 years ago
• yalechang / symnmf
  ☆22Updated 11 years ago
• USC-Melady / KDD19-CoSTCo
  ☆22Updated 2 years ago
• rmgarnett / fast_wl
  A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
  ☆11Updated 7 years ago
• Caselles / graph_kernels
  Four of the main kernels on graphs Python implementation.
  ☆16Updated 8 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 5 years ago
• HazyResearch / HypHC
  Hyperbolic Hierarchical Clustering.
  ☆200Updated last year