Affinity and Distance. On the Newtonian Structure of Some Data Kernels
Let X be a 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 its...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2018-06-01
|
| Series: | Analysis and Geometry in Metric Spaces |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/agms-2018-0005 |