## Dynamic Bayesian Multinets (2000)

### Cached

### Download Links

- [ssli.ee.washington.edu]
- [melodi.ee.washington.edu]
- [melodi.ee.washington.edu]
- [melodi.ee.washington.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 61 - 19 self |

### BibTeX

@MISC{Bilmes00dynamicbayesian,

author = {Jeff A. Bilmes},

title = {Dynamic Bayesian Multinets},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this work, dynamic Bayesian multinets are introduced where a Markov chain state at time t determines conditional independence patterns between random variables lying within a local time window surrounding t. It is shown how information-theoretic criterion functions can be used to induce sparse, discriminative, and classconditional network structures that yield an optimal approximation to the class posterior probability, and therefore are useful for the classification task. Using a new structure learning heuristic, the resulting models are tested on a medium-vocabulary isolated-word speech recognition task. It is demonstrated that these discriminatively structured dynamic Bayesian multinets, when trained in a maximum likelihood setting using EM, can outperform both HMMs and other dynamic Bayesian networks with a similar number of parameters. 1 Introduction While Markov chains are sometimes a useful model for sequences, such simple independence assumptions can lead...