You are here |
blog.cleverelephant.ca | ||
| | | |
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 ... | |
| | | |
hayesall.com
|
|
| | | | k-means clustering can be used on images to automatically perform color quantization. This demonstrates how to cluster colors in an animation. | |
| | | |
blog.42yeah.is
|
|
| | | | ||
| | | |
alvarotrigo.com
|
|
| | What? A slider that only uses CSS, and no JS? Pure CSS and no JavaScript? Yes, it is possible - here's how! |