Nearest Neighbour
Revision as of 10:59, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== K Nearest Neighbour is a simple algorithm that stores all the available cases and classifies the new data or case based on a similarity measure. It is mostly used to classifies a data point based on how its neighbours are classified. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !w...")
Problem Description
K Nearest Neighbour is a simple algorithm that stores all the available cases and classifies the new data or case based on a similarity measure. It is mostly used to classifies a data point based on how its neighbours are classified.
Bounds Chart
Step Chart
Improvement Table
| Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
|---|---|---|
| Exp/Factorial | ||
| Polynomial > 3 | ||
| Cubic | ||
| Quadratic | [Linear search (1940)] | |
| nlogn | k-d Tree (1975) | |
| Linear | Projected radial search (2013)
[Compression/Clustering Vector Quantization (1992)] |
|
| logn |