TSSort: Probabilistic Noise Resistant Sorting
Data Structures and Algorithms
2016-06-17 v1
Abstract
In this paper we present TSSort, a probabilistic, noise resistant, quickly converging comparison sort algorithm based on Microsoft TrueSkill. The algorithm combines TrueSkill's updating rules with a newly developed next item pair selection strategy, enabling it to beat standard sorting algorithms w.r.t. convergence speed and noise resistance, as shown in simulations. TSSort is useful if comparisons of items are expensive or noisy, or if intermediate results shall be approximately ordered.
Cite
@article{arxiv.1606.05289,
title = {TSSort: Probabilistic Noise Resistant Sorting},
author = {Jörn Hees and Benjamin Adrian and Ralf Biedert and Thomas Roth-Berghofer and Andreas Dengel},
journal= {arXiv preprint arXiv:1606.05289},
year = {2016}
}
Comments
10 pages, 2 figures, as of Jan. 2011