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...
Huvudupphovsmän: | Jiao, Y, Vert, J |
---|---|
Materialtyp: | Conference item |
Publicerad: |
PMLR
2018
|
Liknande verk
Liknande verk
-
Automatic Evaluation of Information Ordering: Kendall's Tau
av: Mirella Lapata
Publicerad: (2021-03-01) -
A Multivariate Quantile Based on Kendall Ordering
av: Matthieu Garcin, et al.
Publicerad: (2023-05-01) -
New Results on the Reconstruction of Permutations Distorted By Single Kendall <italic>τ</italic>-Errors
av: Jiyong Lu, et al.
Publicerad: (2022-01-01) -
On kernel-based estimation of conditional Kendall’s tau: finite-distance bounds and asymptotic behavior
av: Derumigny Alexis, et al.
Publicerad: (2019-09-01) -
Using the weighted Kendall Distance to analyze rank data in psychology
av: van Doorn, Johnny, et al.
Publicerad: (2021-06-01)