Title
Finding shareable informative patterns and optimal coding matrix for multiclass boosting
Abstract
A multiclass classification problem can be reduced to a collection of binary problems using an error-correcting coding matrix that specifies the binary partitions of the classes. The final classifier is an ensemble of base classifiers learned on binary problems and its performance is affected by two major factors: the qualities of the base classifiers and the coding matrix. Previous studies either focus on one of these factors or consider two factors separately. In this paper, we propose a new multiclass boosting algorithm called AdaBoost.SIP that considers both two factors simultaneously. In this algorithm, informative patterns, which are shareable by different classes rather than only discriminative on specific single class, are generated at first. Then the binary partition preferred by each pattern is found by performing stage-wise functional gradient descent on a margin-based cost function. Finally, base classifiers and coding matrix are optimized simultaneously by maximizing the negative gradient of such cost function. The proposed algorithm is applied to scene and event recognition and experimental results show its effectiveness in multiclass classification.
Year
DOI
Venue
2009
10.1109/ICCV.2009.5459146
ICCV
Keywords
DocType
Volume
informative patterns,adaboost.sip,error-correcting coding matrix,pattern classification,matrix algebra,multiclass classification,encoding,error correction codes,shareable informative patterns,computer vision,margin-based cost function,entropy,boosting,cost function,tin,error correction code,gradient descent
Conference
2009
Issue
ISSN
ISBN
1
1550-5499 E-ISBN : 978-1-4244-4419-9
978-1-4244-4419-9
Citations 
PageRank 
References 
3
0.45
22
Authors
5
Name
Order
Citations
PageRank
Bang Zhang111112.40
Getian Ye2819.47
Yang Wang310812.95
Jie Xu4648.22
Gunawan Herman5484.00