Nearest Neighbour Searches and the Curse of Dimensionality

DOI10.1093/IMAMAT/24.1.59zbMath0413.68042OpenAlexW2021840029WikidataQ56431350 ScholiaQ56431350MaRDI QIDQ3048245

M. B. Shapiro, Rosalind B. Marimont

Publication date: 1979

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/24.1.59

zbMATH Keywords

curse of dimensionalityefficiency of cut-off algorithmsnearest neighbour searchesratio of variance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

PCA-KL: a parametric dimensionality reduction approach for unsupervised metric learning ⋮ Unconditionally stable Monte Carlo simulation for solving the multi-dimensional Allen-Cahn equation

This page was built for publication: Nearest Neighbour Searches and the Curse of Dimensionality