Conference Proceeding

Multi-class Boosting for Early Classification of Sequences.

01/2010; DOI:10.5244/C.24.24 In proceeding of: British Machine Vision Conference, BMVC 2010, Aberystwyth, UK, August 31 - September 3, 2010. Proceedings
Source: DBLP

ABSTRACT We propose a new boosting algorithm for sequence classification, in particular one that enables early classification of multiple classes. In many practical problems, we would like to classify a sequence into one of K classes as quickly as possible, without waiting for the end of the sequence. Recently, an early classification boosting algorithm was proposed for binary classification that employs a weight propagation technique. In this paper, we extend this model to a multi-class early classification. The derivation is based on the loss function approach, and the developed model is quite simple and effective. We validated the performance through experiments with real-world data, and confirmed the superiority of our approach over the previous method.

0 0
 · 
0 Bookmarks
 · 
52 Views
  • [show abstract] [hide abstract]
    ABSTRACT: We propose a new boosting method for classification of time sequences. In the problem of on-line classification, it is essential to classify time sequences as quickly as possible in many practical cases. This type of classification is called “early classification.” Recently, an Adaboost-based “Earlyboost” has been proposed, which is known for its efficiency. In this paper, we propose a Logitboost-based early classification for further improvements of Earlyboost. We demonstrate the structure of the proposed method, and experimentally verify its performance.
    Computer Analysis of Images and Patterns - 14th International Conference, CAIP 2011, Seville, Spain, August 29-31, 2011, Proceedings, Part I; 01/2011

Full-text (2 Sources)

View
37 Downloads
Available from
Feb 1, 2013