Explore >> Select a destination
|
You are here 
|
www.ekran.org | ||
| | | | |
www.markhw.com
|
|
| | | | | ||
| | | | |
garrit.xyz
|
|
| | | | | Generalist software developer writing about scalable infrastructure, fullstack development and DevOps practices. | |
| | | | |
nurkiewicz.com
|
|
| | | | | K-means clustering is an algorithm for partitioning data into multiple, non-overlapping buckets. For example, if you have a bunch of points in two-dimensional space, this algorithm can easily find concentrated clusters of points. To be honest, that's quite a simple task for humans. Just plot all the points on a piece of paper and find areas with higher density. For example, most of the points are located on the top-left of the plane, some at the bottom and a few at the centre-right. However, this is not ... | |
| | | | |
www.kdnuggets.com
|
|
| | | From the biological neuron to LLMs: How AI became smart. | ||
