Structural hidden Markov models based on stochastic context-free grammars

  • Authors:
  • D. Bouchaffra;J. Tan

  • Affiliations:
  • Oakland University, Rochester, MI;Oakland University, Rochester, MI

  • Venue:
  • Control and Intelligent Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose in this paper a novel paradigm that we named "structural hidden Markov model" (SHMM). It extends traditional hidden Markov models (HMMs) by considering observations as strings derived by a probabilistic context-free grammar. These observations are related in the sense they all contribute to produce a particular structure. SHMMs overcome the limit of state conditional independence of the observations in HMMs. Thus they are capable to cope with structural time series data. We have applied SHMM to data mine customers' preferences for automotive designs. A 5-fold cross-validation has shown a 9% increase of SHMM accuracy over HMM.