Reference point hyperplane trees

Connor, Richard; Amsaleg, Laurent and Houle, Michael E. and Shubert, Erich, eds. (2016) Reference point hyperplane trees. In: 9th International Conference on Similarity Search and Applications. Lecture Notes in Computing Science, 9939 . Springer-Verlag, JPN, pp. 65-78. ISBN 978-3-319-46758-0 (https://doi.org/10.1007/978-3-319-46759-7)

[thumbnail of Connor-SISAP2016-Reference-point-hyperplane-trees]
Preview
 Text. Filename: Connor_SISAP2016_Reference_point_hyperplane_trees.pdf
Accepted Author Manuscript
Download (591kB)| Preview

Abstract

We make the simple observation that, the deeper a data item is within the tree, the higher the probability of that item being excluded from a search. Assuming a fixed and independent probability p of any subtree being excluded at query time, the probability of an individual data item being accessed is (1-p)d for a node at depth d. In a balanced binary tree half of the data will be at the maximum depth of the tree so this effect should be significant and observable. We test this hypothesis with two experiments on partition trees. First, we force a balance by adjusting the partition/exclusion criteria, and compare this with unbalanced trees where the mean data depth is greater. Second, we compare a generic hyperplane tree with a monotone hyperplane tree, where also the mean depth is greater. In both cases the tree with the greater mean data depth performs better in high-dimensional spaces. We then experiment with increasing the mean depth of nodes by using a small, fixed set of reference points to make exclusion decisions over the whole tree, so that almost all of the data resides at the maximum depth. Again this can be seen to reduce the overall cost of indexing. Furthermore, we observe that having already calculated reference point distances for all data, a final filtering can be applied if the distance table is retained. This reduces further the number of distance calculations required, whilst retaining scalability. The final structure can in fact be viewed as a hybrid between a generic hyperplane tree and a LAESA search structure.

CORE (COnnecting REpositories)