$k$-Nearest Neighbors is a clustering-based algorithm for classification and regression. It is a a type of instance-based learning as it does not attempt to construct a general internal model, but simply stores instances of the training data. Prediction is computed from a simple majority vote of the nearest neighbors of each point: a query point is assigned the data class which has the most representatives within the nearest neighbors of the point.
Source of Description and Image: scikit-learn
Paper | Code | Results | Date | Stars |
---|
Task | Papers | Share |
---|---|---|
Clustering | 25 | 8.20% |
General Classification | 20 | 6.56% |
Retrieval | 19 | 6.23% |
Classification | 16 | 5.25% |
Dimensionality Reduction | 9 | 2.95% |
graph partitioning | 9 | 2.95% |
BIG-bench Machine Learning | 9 | 2.95% |
Graph Embedding | 8 | 2.62% |
Self-Supervised Learning | 7 | 2.30% |
Component | Type |
|
---|---|---|
🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |