Error-Correcting Tournaments

Details Error-Correcting Tournaments Error-Correcting Tournaments

2009-02-18

arxiv.org/abs/0902.3176v4

Computer Science

Artificial Intelligence

Minor wording improvements

Scientific paper

We present a family of pairwise tournaments reducing $k$-class classification to binary classification. These reductions are provably robust against a constant fraction of binary errors. The results improve on the PECOC construction \cite{SECOC} with an exponential improvement in computation, from $O(k)$ to $O(\log_2 k)$, and the removal of a square root in the regret dependence, matching the best possible computation and regret up to a constant.

Affiliated with

Also associated with

No associations

Rating

Error-Correcting Tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Error-Correcting Tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error-Correcting Tournaments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128699