Tag Archives: nearest_neighbor_search

Transformed Residual Quantization for Approximate Nearest Neighbor Search

‘The success of product quantization (PQ) for fast nearest neighbor search depends on the exponentially reduced complexities of both storage and computation with respect to the codebook size. Recent efforts have been focused on employing sophisticated optimization strategies, or seeking … Continue reading

Posted in Machine Learning (Narrow Artificial Intelligence) | Tagged , | Comments Off on Transformed Residual Quantization for Approximate Nearest Neighbor Search

Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing

‘Existing methods for retrieving k-nearest neighbours suffer from the curse of dimensionality. We argue this is caused in part by inherent deficiencies of space partitioning, which is the underlying strategy used by almost all existing methods. We devise a new … Continue reading

Posted in Machine Learning (Narrow Artificial Intelligence) | Tagged | Comments Off on Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing