Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

In this paper, we consider the concepts farthest points and nearest points in normed linear spaces, We obtain a necessary and coecient conditions for proximinal, Chebyshev, remotal and uniquely remotal subsets in normed linear spaces. Also, we consider -remotality, -proximinality, coproximinality and co-remotality.

In this paper, we consider Nearest points" and Farthestpoints" in normed linear spaces. For normed space (X; ∥:∥), the set W subset X,we dene Pg; Fg;Rg where g 2 W. We obtion results about on Pg; Fg;Rg. Wend new results on Chebyshev centers in normed spaces. In nally we deneremotal center in normed spaces.

Recently, Bradley and Mangasarian [1] studied the problem of finding the nearest plane to m given points in Rn in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n× n symmetric positive semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0 ≤ q ≤ n− 1.

The metric space model abstracts many proximity or similarity problems, where the most frequently considered primitives are range and k-nearest neighbor search, leaving out the similarity join, an extremely important primitive. In fact, despite the great attention that this primitive has received in traditional and even multidimensional databases, little has been done for general metric databas...

DEFINITION Given a set of n points and a query point, q, the nearest-neighbor problem is concerned with finding the point closest to the query point. Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q. The right shows the problem solution, s. Figure 1: An example of a nearest-neighbor problem dom...