Baum-Welch Learning in Discrete Hidden Markov Models with Linear Factorial Constraints

Authors:
Jens R. Otterpohl
Affiliations:
-
Venue:
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Year:
2002

Citing 1
Cited 1

Factorial Hidden Markov Models

Machine Learning - Special issue on learning with probabilistic representations

A hidden markov model and immune particle swarm optimization-based algorithm for multiple sequence alignment

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Here, I introduce a transformation-based method for extending the Baum-Welch algorithm to the training of discrete Hidden Markov Models subject to constraints on the parameters. A class of certain linear factorial constraints is described and shown to lead to exact reestimation formulas. Applying these constraints to the hidden state transitions allows to estimate processes that are cartesian products of multiple subprocesses on differing timescales. The applicability of the method has been demonstrated previously using constraints on both hidden and observation processes. The potential benefit of the approach is discussed in qualitative comparison to factorial Hidden Markov Model architectures.