Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The Kendall and Mallows Kernels for Permutations

Abstract : We show that the widely used Kendall tau correlation coefficient, and the related Mallows kernel, are positive definite kernels for permutations. They offer computationally attractive alternatives to more complex kernels on the symmetric group to learn from rankings, or learn to rank. We show how to extend these kernels to partial rankings, multivariate rankings and uncertain rankings. Examples are presented on how to formulate typical problems of learning from rankings such that they can be solved with state-of-the-art kernel algorithms. We demonstrate promising results on clustering heterogeneous rank data and high-dimensional classification problems in biomedical applications.
Complete list of metadatas

Cited literature [79 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01279273
Contributor : Yunlong Jiao <>
Submitted on : Monday, September 12, 2016 - 12:49:46 PM
Last modification on : Thursday, April 9, 2020 - 5:08:16 PM
Document(s) archivé(s) le : Tuesday, December 13, 2016 - 1:10:09 PM

File

techreportv2.pdf
Files produced by the author(s)

Identifiers

Citation

Yunlong Jiao, Jean-Philippe Vert. The Kendall and Mallows Kernels for Permutations. 2016. ⟨hal-01279273v2⟩

Share

Metrics

Record views

933

Files downloads

944