15_bibliography and webliography.pdf

More documents

Recommendations

Info

Holmes, I., & Rubin, G. M. (2002). An expectation maximization algorithm for training hidden substitution models. J. Mol. Biol., 317, 753–764. Huang, C., & Darwiche, A. (1996). Inference in belief networks: A procedural guide. International Journal of Approximate Reasoning, 15, 225–263. Johnson, M. A., & Taaffe, M. R. (1988). The denseness of phase distributions (Research Memoranda 88-20). Purdue School of Industrial Engineering. Kanazawa, K. (1991). A logic and time nets for probabilistic inference. AAAI91: Proceedings of the Ninth National Conference on Artificial Intelligence. Karlin, S., & Taylor, H. M. (1998). An introduction to stochastic modeling. San Diego, California: Academic Press. Third edition. Lam, W., & Bacchus, F. (1994). Learning Bayesian belief networks: An approach based on the MDL principle. Computational Intelligence, 10, 269–293. Lando, D. (1998). On Cox processes and credit risky securities. Review of Derivatives Research, 2, 99–120. Lauritzen, S., Dawid, A., Larsen, B., & Leimer, H.-G. (1990). Independence properties of directed Markov fields. Networks, 20, 579–605. Lauritzen, S., & Spiegelhalter, D. (1988). Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50, 157–224. L´evy, P. (1954). Processus semi-Markoviens. Proceedings of the International Congress of Mathematicians (pp. 416–426). Amsterdam, North-Holland. Lipsky, L. R. (1992). Queuing theory: A linear algebraic approach. New York: Macmillan Publishing Company. Minka, T. P. (2001a). Expectation propagation for approximate Bayesian inference. UAI ’01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (pp. 362–369). Morgan Kaufmann Publishers Inc. [ 55 ]
Minka, T. P. (2001b). A family of algorithms for approximate Bayesian inference. Doctoral dissertation, MIT. Moler, C., & Loan, C. V. (2003). Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Review, 45, 3–49. Murphy, K. (2002). Dynamic Bayesian networks: representation, inference, and learning. Doctoral dissertation, University of California, Berkeley. Ng, B., Pfeffer, A., & Dearden, R. (2005). Continuous time particle filtering. Proceedings of the Nineteenth International Joint Conference on AI. Edinburgh, UK. Nodelman, U., & Horvitz, E. (2003). Continuous time Bayesian networks for inferring users’ presence and activities with extensions for modeling and evaluation (Technical Report MSR-TR-2003-97). Microsoft Research. Nodelman, U., Koller, D., & Shelton, C. R. (2005a). Expectation propagation for continuous time Bayesian networks. Proceedings of the Twenty-first Conference on Uncertainty in Artificial Intelligence (pp. 431–440). Nodelman, U., Shelton, C. R., & Koller, D. (2002). Continuous time Bayesian networks. Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (pp. 378–387). Nodelman, U., Shelton, C. R., & Koller, D. (2003). Learning continuous time Bayesian networks. Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (pp. 451–458). Nodelman, U., Shelton, C. R., & Koller, D. (2005b). Expectation maximization and complex duration distributions for continuous time Bayesian networks. Proceedings of the Twenty-first Conference on Uncertainty in Artificial Intelligence (pp. 421–430). Norris, J. R. (1997). Markov chains. Cambridge: Cambrdige University Press. Pearl, J. (1988). Probabilistic reasoning in intelligent systems. Morgan Kauffman. [ 56 ]
Page 1 and 2: BIBLIOGRAPHY Aalen, O. O. (1995).
Page 3: Conference on Machine Learning (pp.
Page 7 and 8: WEBLIOGRAPHY http://en.wikipedia.o
Page 9: www.cs.ubc.ca/~murphyk/Bayes/bayes_

15_bibliography and webliography.pdf

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?