On the geometry of similarity search: dimensionality curse and concentration of measure
<|reference_start|>On the geometry of similarity search: dimensionality curse and concentration of measure: We suggest that the curse of dimensionality affecting the similarity-based search in large datasets is a manifestation of the phenomenon of concentration of measure on high-dimensional structures. We prove that, under certain geometric assumptions on the query domain $\Omega$ and the dataset $X$, if $\Omega$ satisfies the so-called concentration property, then for most query points $x^\ast$ the ball of radius $(1+\e)d_X(x^\ast)$ centred at $x^\ast$ contains either all points of $X$ or else at least $C_1\exp(-C_2\e^2n)$ of them. Here $d_X(x^\ast)$ is the distance from $x^\ast$ to the nearest neighbour in $X$ and $n$ is the dimension of $\Omega$.<|reference_end|>
@article{pestov1999on,
    title={On the geometry of similarity search: dimensionality curse and
  concentration of measure},
    author={Vladimir Pestov},
    journal={Information Processing Letters 73 (2000), 47-51.},
    year={1999},
    number={RP-99-01, Victoria University of Wellington, NZ},
    archivePrefix={arXiv},
    eprint={cs/9901004},
    primaryClass={cs.IR cs.CG cs.DB cs.DS}
}