Dynamic probabilistic relational models

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 992-997

  Sanghai, Sumit ^a   Domingos, Pedro ^a   Weld, Daniel ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX PRODUCTS; DYNAMIC BAYESIAN NETWORKS; EXECUTION MONITORING; MULTIPLE OBJECTS; PARTICLE FILTERING; PROBABILISTIC RELATIONAL MODELS; RAOBLACKWELLISATION; TIME SLICE;

BAYESIAN NETWORKS; INTELLIGENT AGENTS;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. C. Anderson, P. Domingos, and D. Weld. Relational Markov models and their application to adaptive Web navigation. In Proc. 8th ACM SIGKDD Intl. Conf on Knowledge Discovery and Data Mining, pages 143-152, Edmonton, Canada, 2002.
2. C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-specific independence in Bayesian networks. In Proc. 12th Conf. on Uncertainty in Artificial Intelligence, pages 115-123, Portland, OR, 1996.
3. C. Boutilier, R. Reiter, and B. Price. Symbolic dynamic programming for first-order MDPs. In Proc. 17th Intl. Joint Conf. on Artificial Intelligence, pages 690-697, Seattle, WA, 2001.
4. X. Boyen and D. Koller. Tractable inference for complex stochastic processes. In Proc. 14th Conf on Uncertainty in Artificial Intelligence, pages 33-42, Madison, WI, 1998.
5. T. Cover and J. Thomas. Elements of Information Theory. Wiley, New York, 2001.
6. T. Dean and K. Kanazawa. A model for reasoning about persistence and causation. Computational Intelligence, 5(3): 142-150, 1989.
7. A. Doucet, N. de Freitas, and N. Gordon, editors. Sequential Monte Carlo Methods in Practice. Springer, New York, 2001.
8. N. Friedman, D. Koller, and A. Pfeffer. Structured representation of complex stochastic systems. In Proc. 15th National Conf on Artificial Intelligence, pages 157-164, Madison, WI, 1998.
9. N. Friedman, L. Getoor, D. Koller, and A. PfefTer. Learning probabilistic relational models. In Proc. 16th Intl. Joint Conf on Artificial Intelligence, pages 1300-1309, Stockholm, Sweden, 1999.
10. L. Getoor, N. Friedman, D. Koller, and B. Taskar. Learning probabilistic models of relational structure. In Proc. 18th Intl. Conf on Machine Learning, pages 170-177, Williamstown, MA, 2001.
11. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302,2001.
12. K. Kersting, T. Raiko, S. Kramer, and L. De Raedt. Towards discovering structural signatures of protein folds based on logical hidden Markov models. In Proc. 8th Pacific Symposium on Biocomputing, Kauai, HI, 2003.
13. M. Montemerlo, S. Thrun, D. Koller, and B. Wegbreit. FastSLAM: A factored solution to the simultaneous localization and mapping problem. In Proc. 18th National Conf on Artificial Intelligence, pages 593-598, Edmonton, Canada, 2002.
14. A. W. Moore and M. S. Lee. Cached sufficient statistics for efficient machine learning with large datasets. Journal of Artificial Intelligence Research, 8:67-91, 1997.
15. K. Murphy and S. Russell. Rao-Blackwcllised particle filtering for dynamic Bayesian networks. In A. Doucet, N. de Freitas, and N. Gordon, editors, Sequential Monte Carlo Methods in Practice, pages 499-516. Springer, New York, 2001.
16. B. Ng, L. Peshkin, and A. Pfeffer. Factored particles for scalable monitoring. In Proc. 18th Conf on Uncertainty in Artificial Intelligence, Edmonton, Canada, 2002. Morgan Kaufmann.
17. H. Pasula and S. J. Russell. Approximate inference for first-order probabilistic languages. In Proc. 17th Intl. Joint Conf on Artificial Intelligence, pages 741-748, Seattle, WA, 2001.