Nearest neighbors de-duped by default

tdebatty / java-graphs

Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...

Other

34 stars 7 forks source link

Nearest neighbors de-duped by default #4

Closed sanjayobla closed 5 years ago

sanjayobla commented 5 years ago

Hi,

Assume a scenario where there are three points A, B and C where all three are equal and are the nearest neighbors of an external point X. When I use the fastSearch() method to find the top K nearest neighbors (K>3) of a point, I see that only one of these points is being returned. Why is this the case?

Thanks in advance for your response.

-Sanjay

sanjayobla commented 5 years ago

This was a user error. My apologies.