Commit 5a41865

authored

Add links for code examples for K-Means clustering

1 parent af08253 commit 5a41865Copy full SHA for 5a41865

File tree

-0

lines changed

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,6 +30,11 @@ _Image source: [Wikipedia](https://en.wikipedia.org/wiki/K-means_clustering)_`
`30`	`30`
`31`	`31`	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.
`32`	`32`
	`33`	`+## Code Examples`
	`34`	`+`
	`35`	`+- [kMeans.js](./kMeans.js)`
	`36`	`+- [kMeans.test.js](./__test__/kMeans.test.js) (test cases)`
	`37`	`+`
`33`	`38`	`## References`
`34`	`39`
`35`	`40`	`- [k-Means neighbors algorithm on Wikipedia](https://en.wikipedia.org/wiki/K-means_clustering)`

Comments

(0)