Computer Science – Data Structures and Algorithms
Scientific paper
2010-03-29
Computer Science
Data Structures and Algorithms
To be submitted to IEEE Transactions on Pattern Analysis and Machine Intelligence
Scientific paper
We propose an extension of tree-based space-partitioning indexing structures for data with low intrinsic dimensionality embedded in a high dimensional space. We call this extension an Angle Tree. Our extension can be applied to both classical kd-trees as well as the more recent rp-trees. The key idea of our approach is to store the angle (the "dihedral angle") between the data region (which is a low dimensional manifold) and the random hyperplane that splits the region (the "splitter"). We show that the dihedral angle can be used to obtain a tight lower bound on the distance between the query point and any point on the opposite side of the splitter. This in turn can be used to efficiently prune the search space. We introduce a novel randomized strategy to efficiently calculate the dihedral angle with a high degree of accuracy. Experiments and analysis on real and synthetic data sets shows that the Angle Tree is the most efficient known indexing structure for nearest neighbor queries in terms of preprocessing and space usage while achieving high accuracy and fast search time.
Chawla Sanjay
Zvedeniouk Ilia
No associations
LandOfFree
Angle Tree: Nearest Neighbor Search in High Dimensions with Low Intrinsic Dimensionality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Angle Tree: Nearest Neighbor Search in High Dimensions with Low Intrinsic Dimensionality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Angle Tree: Nearest Neighbor Search in High Dimensions with Low Intrinsic Dimensionality will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-499518