Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons
Abstract
In this paper, we initiate the study of the problem of ordering objects from their pairwise comparison results when allowed to discard up to a certain number of objects as outliers. More specifically, we seek to find an ordering under the popular Kendall tau distance measure, i.e., minimizing the number of pairwise comparison results that are inconsistent with the ordering, with some outliers removed. The presence of outliers challenges the assumption that a global consistent ordering exists and obscures the measure. This problem does not admit a polynomial time algorithm unless NP $ \subseteq $ BPP, and therefore, we develop approximation algorithms with provable guarantees for all inputs. Our algorithms have running time and memory usage that are almost linear in the input size. Further, they are readily adaptable to run on massively parallel platforms such as MapReduce or Spark.
Cite
Text
Im and Qaem. "Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2019. doi:10.1007/978-3-030-46150-8_11Markdown
[Im and Qaem. "Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2019.](https://mlanthology.org/ecmlpkdd/2019/im2019ecmlpkdd-fast/) doi:10.1007/978-3-030-46150-8_11BibTeX
@inproceedings{im2019ecmlpkdd-fast,
title = {{Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons}},
author = {Im, Sungjin and Qaem, Mahshid Montazer},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2019},
pages = {173-188},
doi = {10.1007/978-3-030-46150-8_11},
url = {https://mlanthology.org/ecmlpkdd/2019/im2019ecmlpkdd-fast/}
}