From 5a41865787350d1270ae07b2086604caf7d16454 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Mon, 20 Feb 2023 18:41:58 +0100 Subject: [PATCH 01/31] Add links for code examples for K-Means clustering --- src/algorithms/ml/k-means/README.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/src/algorithms/ml/k-means/README.md b/src/algorithms/ml/k-means/README.md index 4221880054..fb58c1bfa4 100644 --- a/src/algorithms/ml/k-means/README.md +++ b/src/algorithms/ml/k-means/README.md @@ -30,6 +30,11 @@ _Image source: [Wikipedia](https://en.wikipedia.org/wiki/K-means_clustering)_ The centroids are moving continuously in order to create better distinction between the different set of data points. As we can see, after a few iterations, the difference in centroids is quite low between iterations. For example between iterations `13` and `14` the difference is quite small because there the optimizer is tuning boundary cases. +## Code Examples + +- [kMeans.js](./kMeans.js) +- [kMeans.test.js](./__test__/kMeans.test.js) (test cases) + ## References - [k-Means neighbors algorithm on Wikipedia](https://en.wikipedia.org/wiki/K-means_clustering) From 46aae1d708f077ad229f200053cab8276fd6317c Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Fri, 24 Feb 2023 23:04:35 -0100 Subject: [PATCH 02/31] Add bakers --- BACKERS.md | 31 ++++++++++++++++++++++++++++++- README.md | 24 ++++++++++++++++++++---- 2 files changed, 50 insertions(+), 5 deletions(-) diff --git a/BACKERS.md b/BACKERS.md index 62c397a38c..ccd5a2d287 100644 --- a/BACKERS.md +++ b/BACKERS.md @@ -8,12 +8,41 @@ ## `O(n²)` Backers -`null` + ## `O(n×log(n))` Backers `null` + +