PAKDD
2004
ACM
14 years 6 months ago
2004
ACM
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
ICDM
2007
IEEE
14 years 7 months ago
2007
IEEE
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
EDBT
2009
ACM
14 years 7 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
111
click to vote
ICDE
2004
IEEE
15 years 2 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...