Elke Achtert
ABSTRACT
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the reverse 1-nearest neighbor problem which has received increasing attention recently. Many industrial and scientific applications call for solutions of the RkNN problem in arbitrary metric spaces where the data objects are not Euclidean and only a metric distance function is given for specifying object similarity. Usually, these applications need a solution for the generalized problem where the value of k is not known in advance and may change from query to query. However, existing approaches, except one, are designed for the specific R1NN problem. In addition - to the best of our knowledge - all previously proposed methods, especially the one for generalized RkNN search, are only applicable to Euclidean vector data but not for general metric objects. In this paper, we propose the first approach for efficient RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our approach uses the advantages of existing metric index structures but proposes to use conservative and progressive distance approximations in order to filter out true drops and true hits. In particular, we approximate the k-nearest neighbor distance for each data object by upper and lower bounds using two functions of only two parameters each. Thus, our method does not generate any considerable storage overhead. We show in a broad experimental evaluation on real-world data the scalability and the usability of our novel approach.
- {1} A. M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters, 9, 1979.Google Scholar
- {2} N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD, 1990. Google ScholarDigital Library
- {3} S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An index structure for high-dimensional data. In Proc. VLDB, 1996. Google ScholarDigital Library
- {4} P. Ciaccia, M. Patella, and P. Zezula. M-Tree: an efficient access method for similarity search in metric spaces. In Proc. VLDB, 1997. Google ScholarDigital Library
- {5} C. Ding and H. Peng. Minimum redundancy feature selection from microarray gene expression data. In CSB03, 2003. Google ScholarDigital Library
- {6} A. Guttman. R-Trees: A dynamic index structure for spatial searching. In Proc. SIGMOD, 1984. Google ScholarDigital Library
- {7} F. Korn and S. Muthukrishnan. Influenced sets based on reverse nearest neighbor queries. In Proc. SIGMOD, 2000. Google ScholarDigital Library
- {8} M. Schroeder. Fractals, Chaos, Power Laws: Minutes from an infinite paradise. W.H. Freeman and company, New York, 1991.Google Scholar
- {9} A. Singh, H. Ferhatosmanoglu, and A. S. Tosun. High dimensional reverse nearest neighbor queries. In Proc. CIKM, 2003. Google ScholarDigital Library
- {10} I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proc. DMKD, 2000.Google Scholar
- {11} Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, 2004. Google ScholarDigital Library
- {12} C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proc. ICDE, 2001. Google ScholarDigital Library
Index Terms
- Efficient reverse k-nearest neighbor search in arbitrary metric spaces
Recommendations
Ranked Reverse Nearest Neighbor Search
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find ...
On multi-type reverse nearest neighbor search
This paper presents a study of the Multi-Type Reverse Nearest Neighbor (MTRNN) query problem. Traditionally, a reverse nearest neighbor (RNN) query finds all the objects that have the query point as their nearest neighbor. In contrast, an MTRNN query ...
Reverse Nearest Neighbor Search in Metric Spaces
Given a set {\cal D} of objects, a reverse nearest neighbor (RNN) query returns the objects o in {\cal D} such that o is closer to a query object q than to any other object in {\cal D}, according to a certain similarity metric. The existing RNN ...
Comments