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...
Главные авторы: | Jiao, Y, Vert, J |
---|---|
Формат: | Conference item |
Опубликовано: |
PMLR
2018
|
Схожие документы
-
Automatic Evaluation of Information Ordering: Kendall's Tau
по: Mirella Lapata
Опубликовано: (2021-03-01) -
A Multivariate Quantile Based on Kendall Ordering
по: Matthieu Garcin, и др.
Опубликовано: (2023-05-01) -
New Results on the Reconstruction of Permutations Distorted By Single Kendall <italic>τ</italic>-Errors
по: Jiyong Lu, и др.
Опубликовано: (2022-01-01) -
On kernel-based estimation of conditional Kendall’s tau: finite-distance bounds and asymptotic behavior
по: Derumigny Alexis, и др.
Опубликовано: (2019-09-01) -
Using the weighted Kendall Distance to analyze rank data in psychology
по: van Doorn, Johnny, и др.
Опубликовано: (2021-06-01)