Skip to contents

Computes a matrix of all the ranks of different algorithms over different datasets (tasks). Ranks are computed from aggregated measures. Smaller ranks imply better methods, so for measures that are minimized, small ranks imply small scores. for measures that are maximized, small ranks imply large scores.

Usage

convertBMRToRankMatrix(
  bmr,
  measure = NULL,
  ties.method = "average",
  aggregation = "default"
)

Arguments

bmr

(BenchmarkResult)
Benchmark result.

measure

(Measure)
Performance measure. Default is the first measure used in the benchmark experiment.

ties.method

(character(1))
See base::rank for details.

aggregation

(character(1))
“mean” or “default”. See getBMRAggrPerformances for details on “default”.

Value

(matrix) with measure ranks as entries. The matrix has one row for each learner, and one column for each task.

Examples

# see benchmark