Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.

DOI10.1016/S0020-0190(02)00344-7zbMath1042.68038OpenAlexW2028975680MaRDI QIDQ1853173

Edgar Chávez, Gonzalo Navarro

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00344-7

zbMATH Keywords

Approximation algorithmsMetric spacesProbabilistic algorithmsDistance based indexingNearest neighbor searchingProximity searching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Probabilistic proximity searching algorithms based on compact partitions ⋮ Feature weighting as a tool for unsupervised feature selection ⋮ Dynamic detection for computer virus based on immune system ⋮ Maximum-likelihood approximate nearest neighbor method in real-time image recognition ⋮ Approximate similarity search: a multi-faceted problem ⋮ Thinking Ultrametrically, Thinking p-Adically

Cites Work

• Unnamed Item
• Unnamed Item
• Nearest neighbor queries in metric spaces
• Fixed queries array: A fast and economical data structure for proximity searching
• Computational geometry
• Multidimensional Binary Search Trees in Database Applications

This page was built for publication: Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.