Boosting input/output hidden markov models for sequence classification

  • Authors:
  • Ke Chen

  • Affiliations:
  • School of Informatics, The University of Manchester, United Kingdom

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Input/output hidden Markov model (IOHMM) has turned out to be effective in sequential data processing via supervised learning. However, there are several difficulties, e.g. model selection, unexpected local optima and high computational complexity, which hinder an IOHMM from yielding the satisfactory performance in sequence classification. Unlike previous efforts, this paper presents an ensemble learning approach to tackle the aforementioned problems of the IOHMM. As a result, simple IOHMMs of different topological structures are used as base learners in our boosting algorithm and thus an ensemble of simple IOHMMs tend to tackle a complicated sequence classification problem without the need of explicit model selection. Simulation results in text-dependent speaker identification demonstrate the effectiveness of boosted IOHMMs for sequence classification.