HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [79 references]  Display  Hide  Download

Contributor : Yunlong Jiao Connect in order to contact the contributor
Submitted on : Monday, September 12, 2016 - 12:49:46 PM
Last modification on : Wednesday, November 17, 2021 - 12:31:24 PM
Long-term archiving on: : Tuesday, December 13, 2016 - 1:10:09 PM


Files produced by the author(s)



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



Record views


Files downloads