Deriving Consensus Rankings from Benchmarking Experiments

• Main Authors: Hornik, Kurt, Meyer, David
• Format: Others
• Language: en
• Published: Department of Statistics and Mathematics, WU Vienna University of Economics and Business 2006
• Subjects: benchmark experiments / consensus rankings / Borda / Condorcet / symmetric difference / linear order / poset / linear programming
• Online Access: http://epub.wu.ac.at/1300/1/document.pdf

Whereas benchmarking experiments are very frequently used to investigate the performance of statistical or machine learning algorithms for supervised and unsupervised learning tasks, overall analyses of such experiments are typically only carried out on a heuristic basis, if at all. We suggest to determine winners, and more generally, to derive a consensus ranking of the algorithms, as the linear order on the algorithms which minimizes average symmetric distance (Kemeny-Snell distance) to the performance relations on the individual benchmark data sets. This leads to binary programming problems which can typically be solved reasonably efficiently. We apply the approach to a medium-scale benchmarking experiment to assess the performance of Support Vector Machines in regression and classification problems, and compare the obtained consensus ranking with rankings obtained by simple scoring and Bradley-Terry modeling. === Series: Research Report Series / Department of Statistics and Mathematics