Alternatives and similar repositories for fair_k_center_clustering

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

• talwagner / fair_clustering
  ☆20Updated 6 years ago
• zalanborsos / coresets
  Coresets
  ☆37Updated 3 years ago
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• iesl / grinch
  Scalable Hierarchical Clustering with Tree Grafting
  ☆28Updated 2 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• horacepan / MLGkernel
  Implementation of the Multiscale Laplacian Graph Kernel
  ☆19Updated 5 years ago
• rsonthal / TreeRep
  Learning Tree structures and Tree metrics
  ☆23Updated 10 months ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆15Updated 5 years ago
• matthieuheitz / WassersteinDictionaryLearning
  Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…
  ☆19Updated 5 years ago
• imtiazziko / Variational-Fair-Clustering
  Variational Fair clustering
  ☆11Updated 11 months ago
• divyat09 / cf-feasibility
  Code accompanying the paper "Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers"
  ☆31Updated 2 years ago
• hhcho / hyplinear
  MATLAB implementation of linear support vector classification in hyperbolic space
  ☆20Updated 7 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆55Updated 6 years ago
• csinva / mdl-complexity
  MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".
  ☆18Updated last year
• charmlab / recourse
  Code to reproduce our paper on probabilistic algorithmic recourse: https://arxiv.org/abs/2006.06831
  ☆36Updated 2 years ago
• mrojascarulla / causal_transfer_learning
  ☆32Updated 6 years ago
• fairkmeans / Fair-K-Means-Clustering
  Code of the paper Fair k-Means Clustering
  ☆13Updated 3 years ago
• rctzeng / NeurIPS2020-SCG
  The code repository for Discovering Conflicting Groups in Signed Networks (NeurIPS 2020)
  ☆15Updated 3 years ago
• ZJULearning / AtSNE
  Anchor-t-SNE for large-scale and high-dimension vector visualization
  ☆55Updated 5 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• fengliu90 / DK-for-TST
  This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).
  ☆49Updated 3 years ago
• cambridge-mlg / CLUE
  Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"
  ☆35Updated last year
• namkoong-lab / robustopt
  ☆43Updated 6 years ago
• wittawatj / kernel-gof
  NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.
  ☆67Updated 5 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• JonathanWenger / pycalib
  Non-Parametric Calibration for Classification (AISTATS 2020)
  ☆19Updated 3 years ago
• dadaromeo / recsys-hpf
  Movies Recommendation with Hierarchical Poisson Factorization in Edward
  ☆18Updated 7 years ago
• davidhallac / NetworkLasso
  ☆22Updated 10 years ago