Approximate similarity search: A multi-faceted problem
Journal of Discrete Algorithms
Speeding up spatial approximation search in metric spaces
Journal of Experimental Algorithmics (JEA)
Efficient Similarity Search by Reducing I/O with Compressed Sketches
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
A Brief Index for Proximity Searching
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Approximate variable-length time series motif discovery using grammar inference
Proceedings of the Tenth International Workshop on Multimedia Data Mining
Symbolic regression using nearest neighbor indexing
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Indexing inexact proximity search with distance regression in pivot space
Proceedings of the Third International Conference on SImilarity Search and APplications
On locality sensitive hashing in metric spaces
Proceedings of the Third International Conference on SImilarity Search and APplications
Approximate and probabilistic methods
SIGSPATIAL Special
An approach to content-based image retrieval based on the Lucene search engine library
ECDL'10 Proceedings of the 14th European conference on Research and advanced technology for digital libraries
A disk-aware algorithm for time series motif discovery
Data Mining and Knowledge Discovery
Fast k-NN classifier for documents based on a graph structure
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Ptolemaic indexing of the signature quadratic form distance
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Succinct nearest neighbor search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Stabilizing the recall in similarity search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Versatile probability-based indexing for approximate similarity search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Efficient group of permutants for proximity searching
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Scalable pattern search analysis
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Approximate distributed metric-space search
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Similarity caching in large-scale image retrieval
Information Processing and Management: an International Journal
Large-scale similarity data management with distributed Metric Index
Information Processing and Management: an International Journal
Use of permutation prefixes for efficient and scalable approximate similarity search
Information Processing and Management: an International Journal
Compact and efficient permutations for proximity searching
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Polyphasic metric index: reaching the practical limits of proximity searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Cut-Region: a compact building block for hierarchical metric indexing
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Parallel approaches to permutation-based indexing using inverted files
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
QuEval: beyond high-dimensional indexing à la carte
Proceedings of the VLDB Endowment
Distributed media indexing based on MPI and MapReduce
Multimedia Tools and Applications
Hi-index | 0.14 |
We introduce a new probabilistic proximity search algorithm for range and $K$-nearest neighbor ($K$-NN) searching in both coordinate and metric spaces. Although there exist solutions for these problems, they boil down to a linear scan when the space is intrinsically high-dimensional, as is the case in many pattern recognition tasks. This, for example, renders the $K$-NN approach to classification rather slow in large databases. Our novel idea is to predict closeness between elements according to how they order their distances towards a distinguished set of anchor objects. Each element in the space sorts the anchor objects from closest to farthest to it, and the similarity between orders turns out to be an excellent predictor of the closeness between the corresponding elements. We present extensive experiments comparing our method against state-of-the-art exact and approximate techniques, both in synthetic and real, metric and non-metric databases, measuring both CPU time and distance computations. The experiments demonstrate that our technique almost always improves upon the performance of alternative techniques, in some cases by a wide margin.