Linear time inference in hierarchical HMMS

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Murphy, Kevin P ^a   Paskin, Mark A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HIDDEN MARKOV MODELS;

APPROXIMATION TECHNIQUES; DYNAMIC BAYESIAN NETWORKS; HIERARCHICAL HIDDEN MARKOV MODELS; INFERENCE ALGORITHM; LINEAR TIME; SPEED UP;

INFERENCE ENGINES;

EID: 84899005183     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. [BFGK96] C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-Specific Independence in Bayesian Networks. In UAI, 1996.
2. [BVW00] H. Bui, S. Venkatesh, and G. West. On the recognition of abstract Markov policies. In AAAI, 2000.
3. [BVW01] H. Bui, S. Venkatesh, and G. West. Tracking and surveillance in wide-area spatial environments using the Abstract Hidden Markov Model. Intl. J. of Pattern Rec. and AI, 2001.
4. [FST98] Shai Fine, Yoram Singer, and Naftali Tishby. The hierarchical Hidden Markov Model: Analysis and applications. Machine Learning, 32:41, 1998.
5. [GJ97] Z. Ghahramani and M. Jordan. Factorial hidden Markov models. Machine Learning, 29:245-273, 1997.
6. [HIM- 00] M. Hu, C. Ingram, M.Sirski, C. Pal, S. Swamy, and C. Patten. A Hierarchical HMM Implementation for Vertebrate Gene Splice Site Prediction. Technical report, Dept. Computer Science, Univ. Waterloo, 2000.
7. [Hoe01] J. Hoey. Hierarchical unsupervised learning of facial expression categories. In ICCV Workshop on Detection and Recognition of Events in Video, 2001.
8. [IB00] Y. Ivanov and A. Bobick. Recognition of visual activities and interactions by stochastic parsing. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8):852-872, 2000.
9. [JGS96] M. I. Jordan, Z. Ghahramani, and L. K. Saul. Hidden Markov decision trees. In NIPS, 1996.
10. [Kja90] U. Kjaerulff. Triangulation of graphs - Algorithms giving small total state space. Technical Report R-90-09, Dept. of Math. and Comp. Sci., Aalborg Univ., Denmark, 1990.
11. [LY90] K. Lari and S. J. Young. The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 4:35-56, 1990.
12. [ME01] D. Moore and I. Essa. Recognizing multitasked activities using stochastic context-free grammar. In CVPR Workshop on Models vs Exemplars in Computer Vision, 2001.
13. [Mur99] K. Murphy. Pearl's algorithm and multiplexer nodes. Technical report, U.C. Berkeley, Dept. Comp. Sci., 1999.
14. [Mur01] K. Murphy. Applying the junction tree algorithm to variable-length DBNs. Technical report, Comp. Sci. Div., UC Berkeley, 2001.
15. [MW01] K. Murphy and Y. Weiss. The Factored Frontier Algorithm for Approximate Inference in DBNs. In UAI, 2001.
16. [NI00] A. Nefian and M. Hayes. Maximum likelihood training of the embedded HMM for face detection and recognition. In IEEE Intl. Conf. on Image Processing, 2000.
17. [PR97] R. Parr and S. Russell. Reinforcement learning with hierarchies of machines. In NIPS, 1997.
18. [Rab89] L. R. Rabiner. A tutorial on Hidden Markov Models and selected applications in speech recognition. Proc. of the IEEE, 77(2):257-286, 1989.
19. [SJ99] L. Saul and M. Jordan. Mixed memory Markov models: Decomposing complex stochastic processes as mixture of simpler ones. Machine Learning, 37(1):75-87, 1999.
20. [SPS99] R.S. Sutton, D. Precup, and S. Singh. Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112:181-211, 1999.
21. [TRM01] G. Theocharous, K. Rohanimanesh, and S. Mahadevan. Learning Hierarchical Partially Observed Markov Decision Process Models for Robot Navigation. In ICRA, 2001.
22. [Zwe97] G. Zweig. Speech Recognition with Dynamic Bayesian Networks. PhD thesis, U.C. Berkeley, Dept. Comp. Sci., 1997.