Login / Signup
The asymptotic complexity of partial sorting - How to learn large posets by pairwise comparisons.
Jobst Heitzig
Published in:
CoRR (2002)
Keyphrases
</>
pairwise comparisons
worst case
pairwise comparison
computational complexity
preference learning
machine learning
pairwise
multi objective
support vector
lower bound