.png){kind=icon}
Return
Ternary Bradley-Terry model-based decoding for multi-class classification and its extensions
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-011-5240-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A multi-class classifier based on the Bradley-Terry model predicts the multi-class label of an input by combining the outputs from multiple binary classifiers, where the combination should be a priori designed as a code word matrix. The code word matrix was originally designed to consist of +1 and -1 codes, and was later extended into deal with ternary code {+1,0,-1}, that is, allowing 0 codes. This extension has seemed to work effectively but, in fact, contains a problem: a binary classifier forcibly categorizes examples with 0 codes into either +1 or -1, but this forcible decision makes the prediction of the multi-class label obscure. In this article, we propose a Boosting algorithm that deals with three categories by allowing a 'don't care' category corresponding to 0 codes, and present a modified decoding method called a 'ternary' Bradley-Terry model. In addition, we propose a couple of fast decoding schemes that reduce the heavy computation by the existing Bradley-Terry model-based decoding.
Keywords:
Multi-class classification
Bradley-Terry model
Ensemble learning
Decoding
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more