Skip to content
This repository has been archived by the owner on Oct 15, 2020. It is now read-only.

Distances

Gabriele Girelli edited this page May 16, 2018 · 24 revisions

A ranking definition

Let tau be the ranking of N weighted elements:

tau_def

  • l_i is the label of the i-th item in tau
  • w_i is the weighte of the i-th item in tau
  • iIN indicates that tau has N elements
  • w_order indicates that the rank is based on the elements weight, and ties are allowed
  • l_unique indicates that each label l can be present only once in tau

Then:

  • Let Ifun be the index of label l in tau, such that Ifun_eq.
    Thus tau_alt_def.
  • Let Lfun denote the set of labels in tau: Lfun_eq,
    and L_i_fun denote the i-th label in rank tau.
  • Let Wfun denote the set of weights in tau: Wfun_eq,
    and W_i_fun denote the i-th weight in rank tau.

Distance between rankings

A distance d between two ranking tau1 and tau2, respectively of N_1 and N_2 elements, can be calculated only when all the labels of one rank are ranked in the other:

d_exists

In this case, eq_size.

Kendall tau (K): consider only the order

...

Kendall tau weighted (Kw): consider the weights

...

Earth Mover's Distance (EMD)

...