A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm

Details A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm

2008-10-23

arxiv.org/abs/0810.4188v1

Computer Science

Information Theory

Scientific paper

We consider the problem of finding high dimensional approximate nearest neighbors. Suppose there are d independent rare features, each having its own independent statistics. A point x will have x_{i}=0 denote the absence of feature i, and x_{i}=1 its existence. Sparsity means that usually x_{i}=0. Distance between points is a variant of the Hamming distance. Dimensional reduction converts the sparse heterogeneous problem into a lower dimensional full homogeneous problem. However we will see that the converted problem can be much harder to solve than the original problem. Instead we suggest a direct approach. It consists of T tries. In try t we rearrange the coordinates in decreasing order of (1-r_{t,i})\frac{p_{i,11}}{p_{i,01}+p_{i,10}} \ln\frac{1}{p_{i,1*}} where 0

Affiliated with

Also associated with

No associations

Rating

A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm 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 A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680026