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)