This repository has been archived by the owner on Oct 15, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
Distances
Gabriele Girelli edited this page May 16, 2018
·
24 revisions
Let be the ranking of
weighted elements:
-
is the label of the
-th item in
-
is the weighte of the
-th item in
-
indicates that
has
elements
-
indicates that the rank is based on the elements weight, and ties are allowed
-
indicates that each label
can be present only once in
Then:
- Let
be the index of label
in
, such that
.
Thus.
- Let
denote the set of labels in
:
,
anddenote the
-th label in rank
.
- Let
denote the set of weights in
:
,
anddenote the
-th weight in rank
.
A distance between two ranking
and
, respectively of
and
elements, can be calculated only when all the labels of one rank are ranked in the other:
In this case, .
![Kdef]
Where:
...
...
GPSeqC v2.3.3
is published under the MIT License - Copyright (c) 2017-18 Gabriele Girelli