Adsorption Layer of Charged Surfaces:  An Exact Nearest-Neighbor Model for the Linear Lattice

Langmuir ◽  
1999 ◽  
Vol 15 (8) ◽  
pp. 2854-2864 ◽  
Author(s):  
Kenneth S. Schmitz
Keyword(s):  
Adsorption Layer ◽  
Nearest Neighbor ◽  
Linear Lattice ◽  
Charged Surfaces ◽  
Exact Nearest Neighbor

Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search

2012 ◽  
Vol 3 (4) ◽  
pp. 75-87
Author(s):  
Bilegsaikhan Naidan ◽  
Magnus Lie Hetland
Keyword(s):  
Query Processing ◽  
Nearest Neighbor ◽  
Nearest Neighbor Search ◽  
Index Structure ◽  
Data Sets ◽  
Search Performance ◽  
Space Partitioning ◽  
Neighbor Search ◽  
Order Of Magnitude ◽  
Exact Nearest Neighbor

This article presents a new approximate index structure, the Bregman hyperplane tree, for indexing the Bregman divergence, aiming to decrease the number of distance computations required at query processing time, by sacrificing some accuracy in the result. The experimental results on various high-dimensional data sets demonstrate that the proposed index structure performs comparably to the state-of-the-art Bregman ball tree in terms of search performance and result quality. Moreover, this method results in a speedup of well over an order of magnitude for index construction. The authors also apply their space partitioning principle to the Bregman ball tree and obtain a new index structure for exact nearest neighbor search that is faster to build and a slightly slower at query processing than the original.

Sign in / Sign up

Export Citation Format

Share Document