Package org.tribuo.math.neighbour
Interface NeighboursQuery
- All Known Implementing Classes:
KDTree
,NeighboursBruteForce
public interface NeighboursQuery
An interface for nearest neighbour query objects.
-
Method Summary
Modifier and TypeMethodDescriptionQueries a set ofSGDVector
s to determine the k points nearest to the provided points.Queries a set ofSGDVector
s to determine the k points nearest to the provided point.queryAll
(int k) Queries a set ofSGDVector
s to determine the k points nearest to every point in the set.
-
Method Details
-
query
Queries a set ofSGDVector
s to determine the k points nearest to the provided point. When there are multiple points equidistant from the provided point, the order in which they are returned may vary depending on the implementation.- Parameters:
point
- The point to determine the nearest k points for.k
- The number of neighbouring points to identify.- Returns:
- A list of k
Pair
s, where a pair contains the index of the neighbouring point in the original data and the distance between this point and the provided point.
-
query
Queries a set ofSGDVector
s to determine the k points nearest to the provided points. When there are multiple points equidistant from a provided point, the order in which they are returned may vary depending on the implementation.- Parameters:
points
- An array of points to determine the nearest k points for.k
- The number of neighbouring points to identify.- Returns:
- An list containing lists of k
Pair
s. There is list entry for each provided point which is a list of k pairs. Each pair contains the index of the neighbouring point in the original data and the distance between this point and the provided point.
-
queryAll
Queries a set ofSGDVector
s to determine the k points nearest to every point in the set. When there are multiple points equidistant from a point in the set, the order in which they are returned may vary depending on the implementation.- Parameters:
k
- The number of neighbouring points to identify.- Returns:
- A list containing lists of k
Pair
s. There is list entry for each provided point which is a list of k pairs. Each pair contains the index of the neighbouring point in the original data and the distance between this point and the provided point.
-