Uses of Interface
smile.neighbor.NearestNeighborSearch

Packages that use NearestNeighborSearch

Package	Description
smile.neighbor	Nearest neighbor search.

Uses of NearestNeighborSearch in smile.neighbor

Classes in smile.neighbor that implement NearestNeighborSearch

Modifier and Type	Class and Description
class	CoverTree<E> Cover tree is a data structure for generic nearest neighbor search, which is especially efficient in spaces with small intrinsic dimension.
class	KDTree<E> A KD-tree (short for k-dimensional tree) is a space-partitioning dataset structure for organizing points in a k-dimensional space.
class	LinearSearch<T> Brute force linear nearest neighbor search.
class	LSH<E> Locality-Sensitive Hashing.