An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
-
Updated
Sep 24, 2020 - Java
An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
Classification using KNN on Vertebral Column Data Set
DepthFirst, BreadthFirst, IterativeDeepening, A*(Tilles out of place, manhattanDistance, chebyshev)
Add a description, image, and links to the chebyshev-distance topic page so that developers can more easily learn about it.
To associate your repository with the chebyshev-distance topic, visit your repo's landing page and select "manage topics."