Given a set of objects and a query q, a point p is
called the reverse k nearest neighbor (RkNN) of q if q is one of
the k closest objects of p. In this paper, we introduce the c...
Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Y...
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
We describe a method for identifying different writing styles of online handwritten characters based on clustering. The motivation of this experiment is to develop automatic chara...
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...