Gromov-wasserstein averaging of kernel and distance matrices
This paper presents a new technique for computing the barycenter of a set of distance or kernel matrices. These matrices, which define the interrelationships between points sampled from individual domains, are not required to have the same size or to be in row-by-row correspondence. We compare these...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2017-12-21T14:48:51Z.
|
| Subjects: | |
| Online Access: | Get fulltext |