Evalica

Pairwise Comparisons

Algorithm

Bradley-Terry, Eigenvector, and Newman algorithms require the comparison graph to be strongly-connected. This option keeps only the largest strongly-connected component (SCC) of the input graph. Some items might be missing as a result of this filtering.

Perform the entire computation but output only five head and five tail items, avoiding overlap.

Examples

This easy-to-use tool transforms pairwise comparisons (aka side-by-side) to a meaningful ranking of items.

As an input, it expects a comma-separated (CSV) file with a header containing the following columns:

  • left: the first compared item
  • right: the second compared item
  • winner: the label indicating the winning item

Possible values for winner are left, right, or tie. The provided examples might be a good starting point.

As the output, this tool provides a table with items, their estimated scores, and ranks.

More Evalica: