The weighted Kendall and high-order kernels for permutations
We propose new positive definite kernels for permutations. First we introduce a weighted version of the Kendall kernel, which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks. Like the Kendall kernel, we show that the weighted version...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Vydáno: |
PMLR
2018
|