• ternary bradley-terry model-based decoding for multi-class classification and its extensions

    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 917
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     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 prioridesigned 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.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین ژورنال ها