A temporally abstracted Viterbi algorithm

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 96-104

  Chatterjee, Shaunak ^a   Russell, Stuart ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING;

COARSE TO FINE; EXPONENTIAL REDUCTION; ORDERS OF MAGNITUDE; SPEED UP; STATE ABSTRACTION; STATE VARIABLES; TEMPORAL ABSTRACTION; TIME-SCALES;

VITERBI ALGORITHM;

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

References (12)

1. Chatterjee, S. and Russell, S. (2010). Why are DBNs sparse?. Journal of Machine Learning Research - Proceedings Track, 9, 81-88.
2. Felzenszwalb, P. F. and McAllester, D. (2007). The generalized A* architecture. J. Artif. Int. Res., 29, 153-190.
3. Forney, G.D., J. (1973). The Viterbi algorithm. Proceedings of the IEEE, 61 (3), 268-278.
4. Holte, R. C., Perez, M. B., Zimmer, R. M., and MacDonald, A. J. (1996). Hierarchical A*: Searching Abstraction Hierarchies Effciently. In AAAI/IAAI, Vol. 1, pp. 530-535.
5. Klein, D. and Manning, C. D. (2003). A* Parsing: Fast Exact Viterbi Parse Selection. In HLT-NAACL.
6. Lytynoja, A. and Milinkovitch, M. C. (2003). A hidden markov model for progressive multiple alignment. Bioinformatics, 19 (12), 1505-1513. (Pubitemid 37038866)
7. Ng, A. Y., Jordan, M. I., andWeiss, Y. (2001). On spectral clustering: Analysis and an algorithm. In NIPS, pp. 849-856.
8. Pavliotis, G. A. and Stuart, A. M. (2007). Multiscale methods: Averaging and homogenization. Springer.
9. Rabiner, L. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77 (2), 257-286.
10. Raphael, C. (2001). Coarse-to-Fine Dynamic Programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23, 1379-1390. (Pubitemid 34035571)
11. Sutton, R. S., Precup, D., and Singh, S. P. (1999). Between MDPs and Semi-MDPs: A Framework for Temporal Abstraction in Reinforcement Learning. Artif. Intell., 112 (1-2), 181-211. (Pubitemid 32079890)
12. Viterbi, A. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. Information Theory, IEEE Transactions on, 13 (2), 260-269.