In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...