News for hackers. Stuff that matters.
Re:Universal Method to Sort Complex Information Found by DoctorOetker on Tuesday August 14, 2018 @11:53AM (#17759042)
I guess the best conversion of cosine similiarity to distance would of course be d(A,B) = arcCos(Cosine_similiarity(A,B)), i.e. the angle between the 2 directions, which would have the property that subdividing a geodesic arc and calculating the sum of distances along the subdivision results in the same distance as the start and end point.

There are no comments on this comment yet.