Effective Proximity Retrieval by Ordering Permutations

By Edgar Chávez, Karina Figueroa, Gonzalo Navarro. 2008

197 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Information Retrieval & Search, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

In Information Retrieval & Search

In Signal Processing

Citations in the corpus

Engineering Efficient and Effective Non-metric Space Library (2013, unknown): “[18] proposed a projective method, which is applicable to both metric and non-metric spaces.”
Succinct nearest neighbor search (2011, background): “The Permutation Index An index called the Permutation Index (PI) [6] has high precision and recall even for datasets of high intrinsic dimension, and can also be used in more general similarity spaces.”
Permutation Search Methods are Efficient, Yet Faster Search is Possible (2015, methodology): “According to Ch´avez et al. [24] Spearman’s rho is more eﬀective than the Footrule distance.”
Learning to Prune in Metric and Non-Metric Spaces (2013, unknown): “Chávez et al. [8] as well as Amato and Savino [2] independently proposed permutation-based search methods.”
Near neighbor searching with K nearest references (2015, methodology): “Our framework captures the behavior of at least five indexes found in the literature: Permutation Index [14], Brief Permutation Index [53], Metric Inverted File [2, 1], Prefix Permutations Index [18, 19], and Succinct Nearest Neighbor Search [54].”
Singleton indexes for nearest neighbor search (2016, methodology): “Clear examples are the AESA algorithm [28] for exact proximity searching, and the Permutation based index [6] in approximate proximity searching.”
Comparative Analysis of Data Structures for Approximate Nearest Neighbor Search (2014, background): “[19], as well as by Amato and Savino [20].”
Inner Product Similarity Search using Compositional Codes (2014, methodology): “In comparison with order permutation [23] in which the similarity between permutation orders is used as a predictor of the closeness, our approach uses the composition of selected dictionary elements to approximate the vector and thus uses it for inner product similarity approximation.”
Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces (2012, methodology): “• A subset of the TREC-3 documents collection containing 24276 documents[23] for comparison with other works.”