All Neighbors
Source header: cuvs/neighbors/all_neighbors.hpp
The all-neighbors algorithm parameters.
GraphBuildParams
The all-neighbors algorithm parameters.
neighbors::all_neighbors::all_neighbors_params
Parameters used to build an all-neighbors graph (find nearest neighbors for all the
training vectors). For scalability, the all-neighbors graph construction algorithm partitions a set of training vectors into overlapping clusters, computes a local knn graph on each cluster, and merges the local graphs into a single global graph. Device memory usage and accuracy can be configured by changing the overlap_factor and n_clusters. The algorithm used to build each local graph is also configurable.
Fields
The all-neighbors knn graph build
neighbors::all_neighbors::build
Builds an approximate all-neighbors knn graph (find nearest neighbors for all the
training vectors)
Usage example:
compute core_distances. If core_distances is given, the resulting indices and distances will be mutual reachability space.
Parameters
Returns
void
Additional overload: neighbors::all_neighbors::build
Builds an approximate all-neighbors knn graph (find nearest neighbors for all the training
vectors) params.n_clusters should be 1 for data on device. To use a larger params.n_clusters for efficient device memory usage, put data on host RAM.
Usage example:
compute core_distances. If core_distances is given, the resulting indices and distances will be mutual reachability space.
Parameters
Returns
void