@inproceedings{bcf501dd142646629aa2a3cee1f4c6e0,
title = "Structured hidden Markov model: A general framework for modeling complex sequences",
abstract = "Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact, the S-HMM structure provides an abstraction mechanism allowing a high level symbolic description of the knowledge embedded in S-HMM to be easily obtained. The paper provides a theoretical analysis of the complexity of the matching and training algorithms on S-HMMs. More specifically, it is shown that Baum-Welch algorithm benefits from the so called locality property, which allows specific components to be modified and retrained, without doing so for the full model. The problem of modeling duration and of extracting (embedding) readable knowledge from (into) a S-HMM is also discussed.",
author = "Ugo Galassi and Attilio Giordana and Lorenza Saitta",
year = "2007",
doi = "10.1007/978-3-540-74782-6\_26",
language = "English",
isbn = "9783540747819",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "290--301",
booktitle = "AI IA 2007",
address = "Germany",
note = "10th Congress of the Italian Association for Artificial Intelligence, AI IA 2007 ; Conference date: 10-09-2007 Through 13-09-2007",
}