Trading Off Granularity against Complexity in Predictive Models for Complex Domains | SpringerLink
Skip to main content

Trading Off Granularity against Complexity in Predictive Models for Complex Domains

  • Conference paper
PRICAI 2000 Topics in Artificial Intelligence (PRICAI 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1886))

Included in the following conference series:

Abstract

The automated prediction of a user’s interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approaches are subject to theoretical and practical limitations which restrict their ability to make useful predictions in domains such as the WWW and computer games that have vast numbers of values for variables of interest. In this paper, we describe an automated abstraction technique which addresses this problem in the context of Dynamic Bayesian Networks. We compare the performance and computational requirements of fine-grained models built with precise variable values with the performance and requirements of a coarse-grained model built with abstracted values. Our results indicate that complex, coarse-grained models offer performance and computational advantages compared to simpler, fine-grained models.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. D.W. Albrecht, I. Zukerman, and A.E. Nicholson. Bayesian models for keyhole plan recognition in an adventure game. User Modeling and User-Adapted Interaction, 8(1–2):5–47, 1998.

    Article  Google Scholar 

  2. G.F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42:393–405, 1990.

    Article  Google Scholar 

  3. P. Dagum and M. Luby. Approximating probabilistic inference in belief networks is NP-hard. Artificial Intelligence, 60:141–153, 1993.

    Article  MATH  Google Scholar 

  4. T. Dean and M.P. Wellman. Planning and control. Morgan Kaufmann Publishers, San Mateo, California, 1991.

    Google Scholar 

  5. R. Dearden and C. Boutilier. Abstraction and approximate decision theoretic planning. Artificial Intelligence, 89(1):219–283, 1997.

    Article  MATH  Google Scholar 

  6. T. Ellman. Symposium on abstraction, reformulation and approximation. http://www.cs.vassar.edu/~ellman/sara98/sara98.html, 1998.

  7. J. Forbes, T. Huang, K. Kanazawa, and S. Russell. The BATmobile: Towards a Bayesian automated taxi. In IJCAI95-Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1878–1885, Montreal, Canada, 1995.

    Google Scholar 

  8. Hugin. HUGIN: Expert, http://www.hugin.dk, 2000.

  9. N. Jitnah. Using Mutual Information for Approximate Evaluation of Bayesian Networks. PhD thesis, Monash University, School of Computer Science and Software Engineering, 1999.

    Google Scholar 

  10. Netica. Norsys: Software corp. http://www.norsys.com/netica.html, 2000.

  11. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Publishers, San Mateo, California, 1988.

    Google Scholar 

  12. D.V. Pynadath and M.P. Wellman. Accounting for context in plan recognition with application to traffic monitoring. In UAI95-Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pages 472–481, Montreal, Canada, 1995.

    Google Scholar 

  13. C.S. Wallace. Classification by minimum-message-length inference. In G. Goos and J. Hartmanis, editors, ICCI’ 90-Advances in Computing and Information, pages 72–81. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  14. M.P. Wellman and C.L. Liu. State-space abstraction for anytime evaluation of probabilistic networks. In UAI94-Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, pages 567–574, Seattle, Washington, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zukerman, I., Albrecht, D.W., Nicholson, A.E., Doktor, K. (2000). Trading Off Granularity against Complexity in Predictive Models for Complex Domains. In: Mizoguchi, R., Slaney, J. (eds) PRICAI 2000 Topics in Artificial Intelligence. PRICAI 2000. Lecture Notes in Computer Science(), vol 1886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44533-1_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-44533-1_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67925-7

  • Online ISBN: 978-3-540-44533-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics