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