Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances

DOI10.1016/j.amc.2018.01.028zbMath1427.68065OpenAlexW2789682958MaRDI QIDQ2001629

Álvaro Cortés, Carolina Gómez-Tostón, Manuel Barrena

Publication date: 10 July 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.01.028

zbMATH Keywords

information filteringmultimedia databasessimilarity searchmetric access methodsindexing methodsinformation search and retrieval

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Uses Software

• UCI-ml
• fminsearch
• DIMACS
• EMD

Cites Work

• Unnamed Item
• Unnamed Item
• Satisfying general proximity/similarity queries with metric trees
• Fixed queries array: A fast and economical data structure for proximity searching
• The earth mover's distance as a metric for image retrieval
• Fifty years of graph matching, network alignment and network comparison
• Similarity search. The metric space approach.
• Some approaches to best-match file searching
• On the sum of distances determined by a pointset
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Pivot selection techniques for proximity searching in metric spaces
• Speeding up spatial approximation search in metric spaces
• Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
• Efficient image retrieval through vantage objects

This page was built for publication: Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances