Uniform spaces and the Newtonian structure of (big)data affinity kernels
Abstract
Let X be a (data) set. Let K(x,y)>0 be a measure of the affinity between the data points x and y. We prove that K has the structure of a Newtonian potential K(x,y)=(d(x,y)) with decreasing and d a quasi-metric on X under two mild conditions on K. The first is that the affinity of each x to itself is infinite and that for x≠ y the affinity is positive and finite. The second is a quantitative transitivity; if the affinity between x and y is larger than λ>0 and the affinity of y and z is also larger than λ, then the affinity between x and z is larger than (λ). The function is concave, increasing, continuous from R+ onto R+ with (λ)<λ for every λ>0.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.