Description Usage Arguments Value Author(s) References Examples
Calculates Kendall kernel between interleaving partial rankings in time O(klogk)
,
where ties (supposed few) are broken by adopting a convolution kernel
averaging compatible rankings without ties.
1 | kendall_partial(x, y)
|
x, y |
Vector.
If |
Kendall kernel for interleaving partial rankings, where ties (supposed few) are broken by adopting a convolution kernel averaging compatible rankings without ties.
Yunlong Jiao
Yunlong Jiao, Jean-Philippe Vert. "The Kendall and Mallows Kernels for Permutations." IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), vol. 40, no. 7, pp. 1755-1769, 2018. DOI:10.1109/TPAMI.2017.2719680
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.