A library gathering diverse algorithms for clustering, similarity search, prototype selection, and data encoding based on k-cluster algorithms.
-
Updated
Jan 9, 2024 - Julia
#
k-centers
Here are 8 public repositories matching this topic...
Speeding up clustering algorithms using Sampling techniques (Lightweight Coresets)
data-science uniform kmedoids-clustering kmeans-clustering bisecting-kmeans-clustring sampling-methods svd-factorization clustering-algorithms leverage-score k-centers coresets lightweight-coresets volume-sampling
-
Updated
May 22, 2021 - Python
Graph Theory. Implementation of greedy algorithm to approximate k centeriods. The algorithm is 2-approximate and runs at a polynomial time complexity.
-
Updated
Jun 13, 2022 - C++
A linear-time k-center algorithm with fairness conditions and worst-case guarantees that is very fast in practice. Written in Rust with Python bindings.
optimization publication operations-research fairness icml graph-algorithm matching-algorithm linear-time k-centers
-
Updated
Feb 12, 2024 - Rust
Repository for implementation details for Data-Science
cms data-science greedy optimal cs count-min-sketch low-rank-approximation visualizing-data count-sketch countmin k-centers misra-gries-sketch misra-gries
-
Updated
May 14, 2021 - Jupyter Notebook
The repository contains implementation of some data science algorithms
data-science data-visualization greedy optimal count-min-sketch svd population-dynamics low-rank-approximation count-sketch k-centers misra-gries-sketch
-
Updated
May 23, 2021 - Jupyter Notebook
Assignments of Data Science Class
data-science greedy optimal low-rank-approximation visualizing-data count-sketch countmin k-centers misra-gries-sketch
-
Updated
May 14, 2021 - Jupyter Notebook
Improve this page
Add a description, image, and links to the k-centers topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the k-centers topic, visit your repo's landing page and select "manage topics."