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