PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
Preprint
Abstract
Nearest neighbor (NN) search is inherently computationally expensive in high-dimensional spaces due to the curse of dimensionality. As a well-known solution, locality-sensitive hashing (LSH) is able to answer c-approximate NN (c-ANN) queries in sublinear time with constant probability. Existing LSH methods focus mainly on building hash bucket-based indexing such that the candidate points can be retrieved quickly. However, existing coarse-grained structures fail to offer accurate distance estimation for candidate points, which translates into additional computational overhead when having to examine unnecessary points. This in turn reduces the performance of query processing. In contrast, we propose a fast and accurate in-memory LSH framework, called PM-LSH, that aims to compute c-ANN queries on large-scale, high-dimensional datasets. First, we adopt a simple yet effective PM-tree to index the data points. Second, we develop a tunable confidence interval to achieve accurate distance estimation and guarantee high result quality. Third, we propose an efficient algorithm on top of the PM-tree to improve the performance of computing c-ANN queries. In addition, we extend PM-LSH to support closest pair (CP) search in high-dimensional spaces. We again adopt the PM-tree to organize the points in a lowdimensional space, and we propose a branch and bound algorithm together with a radius pruning technique to improve the performance of computing c-approximate closest pair (c-ACP) queries. Extensive experiments with real-world data offer evidence that PM-LSH is capable of outperforming existing proposals with respect to both efficiency and accuracy for both NN and CP search.Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- A linear unsupervised transfer learning by preservation of cluster-and-neighborhood data organizationPattern Analysis and Applications, 2018
- Use of locality sensitive hashing (LSH) algorithm to match Web of Science and ScopusScientometrics, 2017
- Efficient $k$ k -closest pair queries in general metric spacesThe VLDB Journal, 2015
- Efficient metric indexing for similarity search2015
- Kernelized locality-sensitive hashing for scalable image search2009
- Solving similarity joins and range queries in metric spaces with the list of twin clustersJournal of Discrete Algorithms, 2009
- An approximate algorithm for top-k closest pairs join query in large high dimensional dataData & Knowledge Engineering, 2005
- Nearest Neighbours Search Using the PM-Tree2005
- Algorithms for processing K-closest-pair queries in spatial databasesData & Knowledge Engineering, 2004
- Handbook of Mathematics and Computational Science1998