Issue No. 09 - September (1993 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.232083
<p>A fast nearest-neighbor algorithm is presented. It works in general spaces in which the known cell techniques cannot be implemented for various reasons, such as the absence of coordinate structure or high dimensionality. The central idea has already appeared several times in the literature with extensive computer simulation results. An exact probabilistic analysis of this family of algorithms that proves its O(1) asymptotic average complexity measured in the number of dissimilarity calculations is presented.</p>
high-dimensional spaces; nearest-neighbor search; dissimilarity spaces; fast nearest-neighbor algorithm; exact probabilistic analysis; O(1) asymptotic average complexity; dissimilarity calculations; computational complexity; pattern recognition; search problems
T. Linder, A. Faragó and G. Lugosi, "Fast Nearest-Neighbor Search in Dissimilarity Spaces," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 957-962, 1993.