Inferring Mixtures of Markov Chains
- Cite this paper as:
- Batu T., Guha S., Kannan S. (2004) Inferring Mixtures of Markov Chains. In: Shawe-Taylor J., Singer Y. (eds) Learning Theory. COLT 2004. Lecture Notes in Computer Science, vol 3120. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.