15_bibliography and webliography.pdf

Boyen, X., & Koller, D. (1998). Tractable inference for complex stochastic
processes. Proceedings of the Fourteenth Conference on Uncertainty in Artificial
Intelligence (pp. 33–42).
Chickering, D. M., Geiger, D., & Heckerman, D. (1994). Learning Bayesian
Networks is NP-Hard (Technical Report MSR-TR-94-17). Microsoft Research.
Colbry, D., Peintner, B., & Pollack, M. E. (2002). Execution monitoring with
quantitative temporal bayesian networks. Proceedings of the Sixth International
Conference on AI Planning and Scheduling.
Dean, T., & Kanazawa, K. (1989). A model for reasoning about persistence and
causation. Computational Intelligence, 5, 142–150.
Dempster, A., N.M.Laird, & D.B.Rubin (1977). Maximum likelihood from
incomplete data via the EM algorithm. Journal of the Royal Statistical Society,
Series B, 39, 1–38.
Duffie, D., Schroder, M., & Skiadas, C. (1996). Recursive valuation of
defaultable securities and the timing of resolution of uncertainty. The Annals of
Applied Probability, 6, 1075–1090.
Durbin, R., Eddy, S., Krogh, A., & Mitchison, G. (1998). Biological sequence
analysis: Probabilistic models of proteins and nucleic acids. Cambridge
University Press.
Economic and Social Research Council (ESRC) Research Centre on Micro-social
Change (2003). British household panel survey. Computer Data File and
Associated Documentation. http://iserwww.essex.ac.uk/bhps. Colchester: The
Data Archive.
El-Hay, T., Friedman, N., Koller, D., & Kupferman, R. (2006). Continuous time
markov networks. Proceedings of the Twenty-second Conference on Uncertainty
in AI (UAI). Boston, Massachussetts.
Friedman, N. (1997). Learning belief networks in the presence of missing values
and hidden variables. ICML ’97: Proceedings of the Fourteenth International
[ 53 ]