An algorithm for nearest neighbor search via monotonic embedding
| 
64 | 
41 | 
0
Abstract
Fast algorithms for nearest neighbor (NN) search have in large part focused on 
2 distance. Here we develop an approach for 
1 distance that begins with an explicit and exactly distance-preserving embedding of the points into 
. We show how this can efficiently be combined with random-projection based methods for 
2 NN search, such as locality-sensitive hashing (LSH) or random projection trees. We rigorously establish the correctness of the methodology and show by experimentation using LSH that it is competitive in practice with available alternatives.
还没有评论，说两句吧！
热门资源
Learning to Predi...
Much of model-based reinforcement learning invo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
The Variational S...
Unlike traditional images which do not offer in...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Rating-Boosted La...
The performance of a recommendation system reli...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
