4 ms·
If the data points are in the space [0,1]^n, and your metric function is: d(x,y) = 0 if x == y; 1 otherwise Then all points are distance one apart. It's been
by hedora 5y ago
If the data points are in the space [0,1]^n, and your metric function is:
d(x,y) = 0 if x == y; 1 otherwise
Then all points are distance one apart. It's been proven that, as dimensionality increases, normal euclidian distance over uniform point clouds rapidly converges to have the same behavior as the equality metric.
The proof relies on the information gained by performing pairwise distance calculations.
In the example distance function I gave, there is zero information gained if you plug in two points that are known to be non-equal.
The information gained from evaluating the Euclidian distance function converges to zero as the dimensionality of the data set increases.
(Note: This does not hold for low dimensional data that's been embedded in a higher dimensional space.)
Edit: Misread your comment. Yes, everything ends up being the same distance apart. More precisely, the ratio of mean distance / stddev distance tends to infinity. The intrinsic dimensionality of the data is monotonic w.r.t. that ratio.