Re:VP trees: A data structure for finding stuff fast
by joshu on Saturday December 03, 2011 @02:09AM
(#3307167)
Right. There are plenty of cases where you ONLY have the distance (or similarity) between two points and don't actually have an n-dimensional point in space.
Imagine beyond 3D like clustering of friends or likes or recommendations or all those other N-dimensional data-points and you'll see the overlap.