5/15/2023 0 Comments Nearest post officeMost commonly M is a metric space and dissimilarity is expressed as a distance metric, which is symmetric and satisfies the triangle inequality. A direct generalization of this problem is a k-NN search, where we need to find the k closest points. 3 of The Art of Computer Programming (1973) called it the post-office problem, referring to an application of assigning to a residence the nearest post office. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.įormally, the nearest-neighbor (NN) search problem is defined as follows: given a set S of points in a space M and a query point q ∈ M, find the closest point in S to q. Nearest neighbor search ( NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point.
0 Comments
Leave a Reply. |