SPLX-Perm: A Novel Permutation-Based Representation for Approximate Metric Search

  title={SPLX-Perm: A Novel Permutation-Based Representation for Approximate Metric Search},
  author={Lucia Vadicamo and Richard C. H. Connor and F. Falchi and Claudio Gennaro and Fausto Rabitti},
  booktitle={Similarity Search and Applications},
Many approaches for approximate metric search rely on a permutation-based representation of the original data objects. The main advantage of transforming metric objects into permutations is that the latter can be efficiently indexed and searched using data structures such as inverted-files and prefix trees. Typically, the permutation is obtained by ordering the identifiers of a set of pivots according to their distances to the object to be represented. In this paper, we present a novel approach… 

Permutation Based Algorithm Improved by Classes for Similarity Searching

An improvement to the first approach to Similarity searching where classes of reference objects were used instead of single references is presented and a new way to evaluate similarity between permutations is proposed.

Indexing Metric Spaces for Exact Similarity Search

Different strengths and weaknesses of different indexing techniques are revealed in order to offer guidance on selecting an appropriate indexing technique for a given setting, and directing the future research for metric indexes.



MI-File: using inverted files for scalable approximate similarity search

A new efficient and accurate technique for generic approximate similarity searching, based on the use of inverted files, that enables us to use inverted files to obtain very efficiently a very small set of good candidates for the query result.

PPP-Codes for Large-Scale Similarity Searching

This work proposes an indexing and search technique that can significantly reduce the candidate set size by combination of several space partitionings, and proposes a mapping of objects from a generic metric space onto main memory codes using several pivot spaces.

Effective Proximity Retrieval by Ordering Permutations

A new probabilistic proximity search algorithm for range and A"-nearest neighbor (A"-NN) searching in both coordinate and metric spaces is introduced to predict closeness between elements according to how they order their distances toward a distinguished set of anchor objects.

Similarity Search - The Metric Space Approach

Similarity Search focuses on the state of the art in developing index structures for searching the metric space, and provides an extensive survey of specific techniques for a large range of applications.

The Inverted Multi-Index

Inverted multi-indices were able to significantly improve the speed of approximate nearest neighbor search on the dataset of 1 billion SIFT vectors compared to the best previously published systems, while achieving better recall and incurring only few percent of memory overhead.

Supermetric Search

Comparing top k lists

Besides the applications to the task of identifying good notions of (dis-)similarity between two top k lists, the results imply polynomial-time constant-factor approximation algorithms for the rank aggregation problem with respect to a large class of distance measures.

Hilbert Exclusion

It is shown that many common metric spaces, notably including those using Euclidean and Jensen-Shannon distances, also have a stronger property, sometimes called the four-point property, and one in particular, which is named the Hilbert Exclusion property, allows any indexing mechanism which uses hyperplane partitioning to perform better.

Product Quantization for Nearest Neighbor Search

This paper introduces a product quantization-based approach for approximate nearest neighbor search. The idea is to decompose the space into a Cartesian product of low-dimensional subspaces and to