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