smile.neighbor

Interface KNNSearch<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 KNNSearch<K,V>

K-nearest neighbor search identifies the top k nearest neighbors to the query. This technique is commonly used in predictive analytics to estimate or classify a point based on the consensus of its neighbors. K-nearest neighbor graphs are graphs in which every point is connected to its k nearest neighbors.

Method Summary

Modifier and Type	Method and Description
Neighbor<K,V>[]	knn(K q, int k) Search the k nearest neighbors to the query.

Method Detail

knn

Neighbor<K,V>[] knn(K q,
                    int k)

Search the k nearest neighbors to the query.

Parameters:

q - the query key.

k - the number of nearest neighbors to search for.