ML Anthology

Inferring Mixtures of Markov Chains

Tugkan Batu, Sudipto Guha, Sampath Kannan
COLT 2004 pp. 186-199
doi:10.1007/978-3-540-27819-1_13 /colt/2004/batu2004colt-inferring/

Abstract

We define the problem of inferring a “mixture of Markov chains” based on observing a stream of interleaved outputs from these chains. We show a sharp characterization of the inference process. The problems we consider also has applications such as gene finding, intrusion detection, etc., and more generally in analyzing interleaved sequences.

PDF COLT Semantic Scholar

Cite

Text

Batu et al. "Inferring Mixtures of Markov Chains." Annual Conference on Computational Learning Theory, 2004. doi:10.1007/978-3-540-27819-1_13

Markdown

[Batu et al. "Inferring Mixtures of Markov Chains." Annual Conference on Computational Learning Theory, 2004.](https://mlanthology.org/colt/2004/batu2004colt-inferring/) doi:10.1007/978-3-540-27819-1_13

BibTeX

@inproceedings{batu2004colt-inferring,
  title     = {{Inferring Mixtures of Markov Chains}},
  author    = {Batu, Tugkan and Guha, Sudipto and Kannan, Sampath},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2004},
  pages     = {186-199},
  doi       = {10.1007/978-3-540-27819-1_13},
  url       = {https://mlanthology.org/colt/2004/batu2004colt-inferring/}
}