Uses of Interface
smile.neighbor.RNNSearch

Packages that use RNNSearch

Package	Description
smile.clustering	Clustering analysis.
smile.neighbor	Nearest neighbor search.

Uses of RNNSearch in smile.clustering

Constructors in smile.clustering with parameters of type RNNSearch

Constructor and Description
DBScan(T[] data, RNNSearch<T,T> nns, int minPts, double radius) Clustering the data.
MEC(T[] data, RNNSearch<T,T> nns, int k, double radius, int[] y) Constructor.

Uses of RNNSearch in smile.neighbor

Classes in smile.neighbor that implement RNNSearch

Modifier and Type	Class and Description
class	BKTree<E> A BK-tree is a metric tree specifically adapted to discrete metric spaces.
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.