Inferring mixtures of Markov chains

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3120, Issue , 2004, Pages 186-199

  Batu, Tuǧkan ^a   Guha, Sudipto ^b   Kannan, Sampath ^b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FUNCTIONS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING; SWITCHING THEORY; CHAINS; INTRUSION DETECTION; MIXTURES;

BAYESIAN NETWORKS; DISCRETE TIME MARKOV CHAINS; GAUSSIAN DISTRIBUTIONS; INTERLEAVING; GENE FINDING; INFERENCE PROCESS; INTERLEAVED SEQUENCE;

MARKOV PROCESSES;

EID: 9444245364     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_13     Document Type: Conference Paper

References (18)

1. Naoki Abe and Manfred Warmuth. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 1992. (to appear in the special issue for COLT 1990).
2. Serge Abiteboul, Victor Vianu, Brad Fordham, and Yelena Yesha. Relational transducers for electronic commerce, pages 179-187, 1998.
3. Sanjeev Arora and Ravi Kannan. Learning mixtures of arbitrary gaussians. In ACM Symposium on Theory of Computing, pages 247-257, 2001.
4. Y. Bengio and P. Frasconi. Input-output HMM's for sequence processing. IEEE Transactions on Neural Networks, 7(5):1231-1249, September 1996.
5. C.B. Burge and S. Karlin. Finding the genes in genomic dna. J. Mol. Bio., 268:78-94, 1997.
6. Sanjoy Dasgupta. Learning mixtures of gaussians. Technical Report CSD-99-1047, University of California, Berkeley, May 19, 1999.
7. Dorothy E. Denning. An intrusion-detection model. Transactions of software engineering, 13(2):222-232, 1987.
8. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, New York, 1974.
9. Tom Fawcett and Foster J. Provost. Adaptive fraud detection. Data Mining and Knowledge Discovery, 1(3):291-316, 1997.
10. Yoav Freund and Dana Ron. Learning to model sequences generated by switching distributions. In Proceedings of the 8th Annual Conference on Computational Learning Theory (COLT'95), pages 41-50, New York, NY, USA, July 1995, ACM Press.
11. Charles Kervrann and Fabrice Heitz. A hierarchical Markov modeling approach for the segmentation and tracking of deformable shapes. Graphical models and image processing: GMIP, 60(3): 173-195, 1998.
12. Wenke Lee, Salvatore J. Stolfo, and Kui W. Mok. A data mining framework for building intrusion detection models. In IEEE Symposium on Security and Privacy, pages 120-132, 1999.
13. Alon Y. Levy and Daniel S. Weld. Intelligent internet systems. Artificial Intelligence, 118(1-2):1-14, 2000.
14. Lawrence R. Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2), 1989.
15. Marc Spielmann. Verification of relational transducers for electronic commerce. In Symposium on Principles of Database Systems, pages 92-103, 2000.
16. B. Thiesson, C. Meek, D. Chickering, and D. Hecker man. Learning mixtures of Bayesian networks. Technical Report MSR-TR-97-30, Microsoft Research, Redmond, WA, 1997.
17. Bo Thiesson, Christopher Meek, David Maxwell Chickering, and David Heckerman. Learning mixtures of DAG models. In Gregory F. Cooper and Serafin Moral, editors. Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 504-513, San Francisco, July 24-26 1998. Morgan Kaufmann.
18. Christina Warrender, Stephanie Forrest, and Barak A. Pearlmutter. Detecting intrusions using system calls: Alternative data models. In IEEE Symposium on Security and Privacy, pages 133-145, 1999.