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)