Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search

Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search DOWNLOAD PROJECT SYNOPSIS High-dimensional k nearest neighbor (kNN) search has a wide range of applications in multimedia information retrieval. Existing disk-based kNN search methods incur significant I/O costs in the candidate refinement phase.  Propose to cache compact approximate representations of data points in main memory in order to reduce the candidate refinement time during kNN search. This problem raises two challenging issues: (i) which is the most effective encoding scheme for data points to support kNN search? and (ii) what…

Read More