| Class | Description |
|---|---|
| BallTree |
Class implementing the BallTree/Metric Tree algorithm for nearest neighbour search.
The connection to dataset is only a reference. |
| CoverTree |
Class implementing the CoverTree datastructure.
The class is very much a translation of the c source code made available by the authors. For more information and original source code see: Alina Beygelzimer, Sham Kakade, John Langford: Cover trees for nearest neighbor. |
| KDTree |
Class implementing the KDTree search algorithm for nearest neighbour search.
The connection to dataset is only a reference. |
| LinearNNSearch |
Class implementing the brute force search algorithm for nearest neighbour search.
|
| NearestNeighbourSearch |
Abstract class for nearest neighbour search.
|
| PerformanceStats |
The class that measures the performance of a nearest
neighbour search (NNS) algorithm.
|
| TreePerformanceStats |
The class that measures the performance of a tree based
nearest neighbour search algorithm.
|