The nearest neighbor problem in an abstract metric space

Authors:
Charles D Feustel;Linda G Shapiro
Affiliations:
Department of Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, U.S.A.;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, U.S.A.
Venue:
Pattern Recognition Letters
Year:
1982

Citing 3
Cited 0

An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers
Organization of Relational Models for Scene Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

Given a database of relational models, we would like to select those models that are closest to an unknown relational description. Since relational distance is expensive to compute, we want to minimize our distance calculations. In this paper we present a new method for achieving this goal in an abstract metric space.