Polychotomous Classification with Pairwise Classifiers: A New Voting Principle

dc.contributor.authorCutzu, Florin
dc.date.accessioned2025-11-12T00:20:17Z
dc.date.available2025-11-12T00:20:17Z
dc.date.issued2003-01
dc.description.abstractA new principle for performing polychotomous classification with pairwise classifiers is introduced: if pairwise classifier $\mathcal{N}_{ij}$, trained to discriminate between classes $i$ and $j$, responds ``i'' for an input $\myvec x$ from an unknown class (not necessarily $i$ or $j$), one can at best conclude that $\myvec{x} \not \in j$. Thus, the output of pairwise classifier $\mathcal{N}_{ij}$ can be interpreted as a vote against the losing class $j$, and not, as existing methods propose, as a vote for the winning class $i$. Both a discrete and a continuous classification model derived from this principle are introduced.
dc.identifier.urihttps://hdl.handle.net/2022/34416
dc.relation.ispartofseriesIndiana University Computer Science Technical Reports; TR573
dc.rightsThis work is protected by copyright unless stated otherwise.
dc.rights.uri
dc.titlePolychotomous Classification with Pairwise Classifiers: A New Voting Principle

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR573.pdf
Size:
174.47 KB
Format:
Adobe Portable Document Format
Can’t use the file because of accessibility barriers? Contact us