On nonmetric similarity search problems in complex domains

DOI10.1145/1978802.1978813zbMath1293.68106OpenAlexW2020271151MaRDI QIDQ2875073

Benjamin Bustos, Tomáš Skopal

Publication date: 13 August 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1978802.1978813

zbMATH Keywords

similarity retrievalsimilarity measuringapproximate and exact searchnonmetric distances

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20)

Related Items (3)

Learning a hybrid similarity measure for image retrieval ⋮ Distance-based index structures for fast similarity search ⋮ From Similarity to Distance: Axiom Set, Monotonic Transformations and Metric Determinacy

This page was built for publication: On nonmetric similarity search problems in complex domains