The VLDB Journal — The International Journal on Very Large Data Bases
Non-parametric detection of meaningless distances in high dimensional data
Statistics and Computing
An effective multi-dimensional index strategy for cluster architectures
CIVR'05 Proceedings of the 4th international conference on Image and Video Retrieval
| Hi-index | 0.00 |
In this paper, we present a fast approximate nearest neighbor (NN) search index structure called the AB-tree, which uses heuristics to decide whether or not to access a node in the index tree based on the intersecting angle and the weight of the node. The goal of the NN search algorithm presented in this paper is to decrease unnecessary node accesses in the search due to overlap among bounding regions in existing index structures. We have observed the following three properties of bounding hyperspheres that motivated the creation of the proposed heuristics for NN search.