Probabilistic proximity searching algorithms based on compact partitions

DOI10.1016/S1570-8667(03)00067-4MaRDI QIDQ876710zbMATH OpenFDO

Authors Benjamin Bustos, Gonzalo Navarro

Publication date 26 April 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

approximate algorithmsrange queriesprobabilistic algorithmsauthor keywords: metric spacessimilarity searching

Mathematics Subject Classification ID

Randomized algorithms (68W20) Search theory (90B40) Searching and sorting (68P10)

Recommendations

• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
• scientific article; zbMATH DE number 1893567
• Speeding up spatial approximation search in metric spaces
• On the Least Cost for Proximity Searching in Metric Spaces
• Probably correct \(k\)-nearest neighbor search in high dimensions

Cites work

• scientific article; zbMATH DE number 1003290 (Why is no real title available?)
• scientific article; zbMATH DE number 1445324 (Why is no real title available?)
• A Data Structure and an Algorithm for the Nearest Point Problem
• Approximate similarity search: a multi-faceted problem
• Nearest neighbor queries in metric spaces
• Pivot selection techniques for proximity searching in metric spaces
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
• Satisfying general proximity/similarity queries with metric trees

Cited in

(4)

• Approximate similarity search: a multi-faceted problem
• Querying probabilistic neighborhoods in spatial data sets efficiently
• scientific article; zbMATH DE number 1893567 (Why is no real title available?)
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.

This page was built for publication: Probabilistic proximity searching algorithms based on compact partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876710)