9 search results - page 2 / 2 » Efficient reverse k-nearest neighbor search in arbitrary met... |
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
BMCBI
2011
12 years 8 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...