Dynamic graphical models

IEEE Signal Processing Magazine

Volumn 27, Issue 6, 2010, Pages 29-42

  Bilmes, Jeff ^a,b  

^a University of Washington   (United States)

^b Department of Computer Science and Engineering ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

DYNAMIC GRAPHICAL MODELS; NP COMPLETE; OPTIMIZATION PROBLEMS; PROBLEM INSTANCES;

PROBLEM SOLVING;

EID: 85032751937     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2010.938078     Document Type: Article

References (28)

1. [I] F. Bacchus, S. Dalmao, and T. Pitassi, "Value elimination: Bayesian inference via backtracking search," in Proc. Conf. Uncertainty in Artificial Intelligence. San Mateo, CA: Morgan Kaufmann, 2003, pp. 20-28.
2. C. Bartels and J. Bilmes, "Non-minimal triangulations for mixed stochastic/deterministic graphical models," in Proc. Conf. Uncertainty in Artificial Intelligence. Cambridge, MA: AUAI, July 2006, pp. 15-22.
3. J. Bilmes and C. Bartels, "On triangulating dynamic graphical models," in Proc. Conf. Uncertainty in Artificial Intelligence. Acapulco, Mexico: Morgan Kaufmann, 2003, pp. 47-56.
4. A. Darwiche, "Recursive conditioning," Artif. Intell., vol. 126, no. 1-2, pp. 5-41, 2001.
5. R. Dechter, Constraint Processing. San Mateo, CA: Morgan Kaufmann, 2003.
6. Z. Ghahramani and M. Jordan, "Factorial hidden Markov models," Mach. Learn., vol. 29, no. 2, pp. 245-273, 1997.
7. J. R. Glass, "A probabilistic framework for segment-based speech recognition," Comput. Speech Lang., vol. 17, no. 2-3, pp. 137-152, 2003.
8. P. S. Gopalakrishnan and L. R. Bahl, "Fast match techniques," in Automatic Speech and Speaker Recognition: Advanced Topics, C.-H. Lee, F. K. Soong, and K. K. Paliwal, Eds. Norwell, MA: Kluwer, 1996, pp. 413-428.
9. X. D. Huang, A. Acero, and H.-W. Hon, Spoken Language Processing: A Guide to Theory, Algorithm, and System Development. Englewood Cliffs, NJ: Prentice-Hall, 2001.
10. F. V. Jensen, Bayesian Networks and Decision Graphs. New York: Springer-Verla g, 2001.
11. [II] M. I. Jordan, "Graphical models," Statist. Sci., vol. 19, no. 1, pp. 140-155, 2004.
12. U. Kjærulff, "A computational scheme for reasoning in dynamic probabilistic networks," in Proc. Conf. Uncertainty in Artificial Intelligence. San Francisco, CA: Morgan Kaufmann, 1992, pp. 121-129.
13. D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques. Cambridge, MA: MIT Press, Aug. 2009.
14. F. R. Kschischang, B. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, 2001.
15. J. Lafferty, A. McCallum, and F. Pereira, "Conditional random fields: Probabilistic models for segmenting and labeling sequence data," in Proc. Int. Conf. Machine Learning. San Francisco, CA: Morgan Kaufmann, 2001, pp. 282-289.
16. S. L. Lauritzen, Graphical Models. Oxford Science Publications. Oxford, U.K.: Oxford Univ. Press, 1996.
17. C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proc. Design Automation Conf. (DAC'01), Las Vegas, June 2001, pp. 530-535.
18. A. L. Madsen and D. Nilsson, "Solving influence diagrams using HUGIN, Shafer-Shenoy and Lazy propagation," in Proc. Conf. Uncertainty in Artificial Intelligence, vol. 17. San Mateo, CA: Morgan Kaufmann, 2001, pp. 337-345.
19. K. Murphy, "Dynamic Bayesian networks: Representation, inference and learning," Ph.D. dissertation, Dept. of EECS, CS Division, Univ. California, Berkeley, 2002.
20. H. Nagamochi and T. Ibaraki, Algorithmic Aspects of Graph Connectivity. Cambridge, U.K.: Cambridge Univ. Press, 2008.
21. H. Ney, S. Ortmanns, and T. H. Aachen, "Progress in dynamic programming search for LVCSR," Proc. IEEE, vol. 88, no. 8, pp. 1224-1240, 2000.
22. D. B. Paul, "An efficient A* stack decoder algorithm for continuous speech recognition with a stochastic language model," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, 1992, pp. 693-696.
23. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, 2nd ed. San Mateo, CA: Morgan Kaufmann, 1988.
24. S. M. Reynolds, L. Kall, M. E. Riffle, J. Bilmes, and W. Noble, "Transmem-brane topology and signal peptide prediction using dynamic Bayesian networks," PLoS Comput. Biol., vol. 4, no. 11, Nov. 2008.
25. D. J. Rose, R. E. Tarjan, and G. S. Lueker, "Algorithmic aspects of vertex elimination on graphs," SIAM J. Comput., vol. 5, no. 2, pp. 266-282, 1976.
26. S. J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2003.
27. L. K. Saul and M. I. Jordan, "Boltzmann chains and hidden Markov models," in Proc. Neural Information Processing Society (NIPS'95), 1995, pp. 435-442.
28. Y. Xiang, "Temporally invariant junction tree for inference in dynamic Bayesian network," in Lecture Notes in Computer Science, vol. 1600, M. J. Wooldridge and M. Veloso, Eds. Berlin: Springer-Verlag, 1999, pp. 473-487.