k-Means Clustering is a clustering algorithm that divides a training set into $k$ different clusters of examples that are near each other. It works by initializing $k$ different centroids {$\mu\left(1\right),\ldots,\mu\left(k\right)$} to different values, then alternating between two steps until convergence:
(i) each training example is assigned to cluster $i$ where $i$ is the index of the nearest centroid $\mu^{(i)}$
(ii) each centroid $\mu^{(i)}$ is updated to the mean of all training examples $x^{(j)}$ assigned to cluster $i$.
Text Source: Deep Learning, Goodfellow et al
Image Source: scikit-learn
Paper | Code | Results | Date | Stars |
---|
Task | Papers | Share |
---|---|---|
Clustering | 190 | 19.57% |
Object Detection | 131 | 13.49% |
Semantic Segmentation | 26 | 2.68% |
Autonomous Driving | 21 | 2.16% |
Classification | 17 | 1.75% |
Image Classification | 14 | 1.44% |
BIG-bench Machine Learning | 14 | 1.44% |
Self-Supervised Learning | 13 | 1.34% |
Real-Time Object Detection | 13 | 1.34% |
Component | Type |
|
---|---|---|
🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |