Boosting algorithm with sequence-loss cost function for structured prediction

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of sequence prediction i.e. annotating sequences appears in many problems across a variety of scientific disciplines, especially in computational biology, natural language processing, speech recognition, etc. The paper investigates a boosting approach to structured prediction, AdaBoost STRUCT, based on proposed sequence-loss balancing function, combining advantages of boosting scheme with the efficiency of dynamic programming method. In the paper the method's formalism for modeling and predicting label sequences is introduced as well as examined, presenting its validity and competitiveness. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Kajdanowicz, T., Kazienko, P., & Kraszewski, J. (2010). Boosting algorithm with sequence-loss cost function for structured prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6076 LNAI, pp. 573–580). https://doi.org/10.1007/978-3-642-13769-3_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free