When is `nearest neighbour' meaningful: A converse theorem and implications

DOI10.1016/j.jco.2009.02.011zbMath1173.62001DBLPjournals/jc/DurrantK09OpenAlexW2031406373WikidataQ58550444 ScholiaQ58550444MaRDI QIDQ2272155

Robert J. Durrant, Ata Kabán

Publication date: 6 August 2009

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2009.02.011

zbMATH Keywords

high dimensionalitylatent variable modelsdistance concentration

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01)

Related Items (6)

On the distance concentration awareness of certain data reduction techniques ⋮ Distance geometry and data science ⋮ Unnamed Item ⋮ Non-parametric detection of meaningless distances in high dimensional data ⋮ A survey on unsupervised outlier detection in high‐dimensional numerical data ⋮ Random projection-based auxiliary information can improve tree-based nearest neighbor search

Uses Software

• boost

Cites Work

• On the geometry of similarity search: dimensionality curse and concentration of measure
• A First Look at Rigorous Probability Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: When is `nearest neighbour' meaningful: A converse theorem and implications