Analysis of approximate nearest neighbor searching with clustered point sets

Details Analysis of approximate nearest neighbor searching with clustered point sets Analysis of approximate nearest neighbor searching with clustered point sets

1999-01-26

arxiv.org/abs/cs/9901013v1

Computer Science

Computational Geometry

20 pages, 8 figures. Presented at ALENEX '99, Baltimore, MD, Jan 15-16, 1999

Scientific paper

We present an empirical analysis of data structures for approximate nearest neighbor searching. We compare the well-known optimized kd-tree splitting method against two alternative splitting methods. The first, called the sliding-midpoint method, which attempts to balance the goals of producing subdivision cells of bounded aspect ratio, while not producing any empty cells. The second, called the minimum-ambiguity method is a query-based approach. In addition to the data points, it is also given a training set of query points for preprocessing. It employs a simple greedy algorithm to select the splitting plane that minimizes the average amount of ambiguity in the choice of the nearest neighbor for the training points. We provide an empirical analysis comparing these two methods against the optimized kd-tree construction for a number of synthetically generated data and query sets. We demonstrate that for clustered data and query sets, these algorithms can provide significant improvements over the standard kd-tree construction for approximate nearest neighbor searching.

Affiliated with

Also associated with

No associations

Rating

Analysis of approximate nearest neighbor searching with clustered point sets 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 Analysis of approximate nearest neighbor searching with clustered point sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of approximate nearest neighbor searching with clustered point sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251493