Inferring Mixtures of Markov Chains

  • Tuğkan Batu
  • Sudipto Guha
  • Sampath Kannan
Conference paper

DOI: 10.1007/978-3-540-27819-1_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3120)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Tuğkan Batu
    • 1
  • Sudipto Guha
    • 2
  • Sampath Kannan
    • 2
  1. 1.Department of Computer SciencesUniversity of TexasAustin
  2. 2.Department of Computer and Information ScienceUniversity of PennsylvaniaPhiladelphia

Personalised recommendations