Uses of Interface
smile.neighbor.KNNSearch

Packages that use KNNSearch

Package	Description
smile.classification	Classification algorithms.
smile.neighbor	Nearest neighbor search.

Uses of KNNSearch in smile.classification

Constructors in smile.classification with parameters of type KNNSearch

Constructor and Description
KNN(KNNSearch<T,T> knn, int[] y, int k) Constructor.

Uses of KNNSearch in smile.neighbor

Classes in smile.neighbor that implement KNNSearch

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.