Bi-stochastic kernels via asymmetric affinity functions

Abstract

In this short letter we present the construction of a bi-stochastic kernel p for an arbitrary data set X that is derived from an asymmetric affinity function α. The affinity function α measures the similarity between points in X and some reference set Y. Unlike other methods that construct bi-stochastic kernels via some convergent iteration process or through solving an optimization problem, the construction presented here is quite simple. Furthermore, it can be viewed through the lens of out of sample extensions, making it useful for massive data sets.

5 pages. v2: Expanded upon the first paragraph of subsection 2.1. v3: Minor changes and edits. v4: Edited comments and added DOI

Cited by in corpus (8)

• Operator-theoretic framework for forecasting nonlinear time series with kernel analog techniques
• Reproducing kernel Hilbert space compactification of unitary evolution groups
• Spectral analysis of climate dynamics with operator-theoretic approaches
• Manifold learning with bi-stochastic kernels
• A unified framework for harmonic analysis of functions on directed graphs and changing data
• Quantum mechanics and data assimilation
• Consistent spectral approximation of Koopman operators using resolvent compactification
• Data Assimilation in Operator Algebras