Succinct nearest neighbor search
Eric S. Téllez, Edgar Chávez, Gonzalo Navarro · 2011
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions represented by a single object, called the reference. To search for nearest neighbors a set of candidate references is first obtained and later enriched with the database objects associated to those references.