next up previous contents
Next: Theoretical Considerations Up: Round Robin Classification Previous: Accuracy   Contents


At first sight, it appears to be a questionable idea to replace c binary learning tasks (unordered binarization) with c(c-1)/2 binary learning tasks (round robin binarization) because the quadratic complexity seems to be prohibitive for tasks with more than a few classes. This section will illustrate that this is not the case.


Johannes Fürnkranz 2002-03-11