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 R. Connor and F. Falchi and C. Gennaro and F. Rabitti},
  • Lucia Vadicamo, R. Connor, +2 authors F. Rabitti
  • Published in SISAP 2019
  • Computer Science
  • 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… CONTINUE READING
    2 Citations

    Figures and Topics from this paper.


    Use of permutation prefixes for efficient and scalable approximate similarity search
    • Andrea Esuli
    • Mathematics, Computer Science
    • Inf. Process. Manag.
    • 2012
    • 50
    • PDF
    MI-File: using inverted files for scalable approximate similarity search
    • 57
    PPP-Codes for Large-Scale Similarity Searching
    • 14
    Effective Proximity Retrieval by Ordering Permutations
    • 184
    • PDF
    Similarity Search - The Metric Space Approach
    • 780
    • PDF
    Some Theoretical and Experimental Observations on Permutation Spaces and Similarity Search
    • 7
    The Inverted Multi-Index
    • A. Babenko, V. Lempitsky
    • Computer Science, Medicine
    • IEEE Transactions on Pattern Analysis and Machine Intelligence
    • 2012
    • 124
    • PDF
    Supermetric Search
    • 10
    • PDF
    Comparing top k lists
    • 919
    • PDF
    Hilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings
    • 15
    • PDF