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...
Main Authors: | Jiao, Y, Vert, J |
---|---|
Format: | Conference item |
Published: |
PMLR
2018
|
Similar Items
-
Automatic Evaluation of Information Ordering: Kendall's Tau
by: Mirella Lapata
Published: (2021-03-01) -
A Multivariate Quantile Based on Kendall Ordering
by: Matthieu Garcin, et al.
Published: (2023-05-01) -
New Results on the Reconstruction of Permutations Distorted By Single Kendall <italic>τ</italic>-Errors
by: Jiyong Lu, et al.
Published: (2022-01-01) -
Decomposing random permutations into order-isomorphic subpermutations
by: Groenland, C, et al.
Published: (2023) -
Kernel methods in computational biology /
by: Scholkopf, Bernhard, et al.
Published: (2004)