资源分类
》 资源 》论文》The Kendall and Mallows Kernels for Permutations

The Kendall and Mallows Kernels for Permutations

2020-03-05 | |  62 |   44 |   0

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 to learn to rank. We show how to extend the Kendall kernel to partial rankings or rankings with uncertainty, and demonstrate promising results on high-dimensional classification problems in biomedical applications.

上一篇：Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions

下一篇：Information Geometry and Minimum Description Length Networks

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...