smile.neighbor

Interface NearestNeighborSearch<K,V>

Type Parameters:

K - the type of keys.

V - the type of associated objects.

All Known Implementing Classes:

CoverTree, KDTree, LinearSearch, LSH, MPLSH, SNLSH

public interface NearestNeighborSearch<K,V>

Nearest neighbor search, also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point q ∈ M, find the closest point in S to q.

Method Summary

Modifier and Type	Method and Description
Neighbor<K,V>	nearest(K q) Search the nearest neighbor to the given sample.

Method Detail

nearest

Neighbor<K,V> nearest(K q)

Search the nearest neighbor to the given sample.

Parameters:

q - the query key.

Returns:

the nearest neighbor