Abstract
This paper presents a procedure for the construction of probabilistic networks from a database of observations based on the minimum description length principle. On top of the advantages of the Bayesian approach the minimum description length principle offers the advantage that every probabilistic network structure that represents the same set of independencies gets assigned the same quality. This makes it is very suitable for the order optimization procedure as described in [4]. Preliminary test results show that the algorithm performs comparable to the algorithm based on the Bayesian approach [6].
Preview
Unable to display preview. Download preview PDF.
References
S. Andreassen, M. Wolbye, B. Falck, and S.K. Andersen. Munim — a causal probabilistic network for interpretation of electromyographic findings. In Proceedings of the IJCAI, pages 366–372, Milan, Italy, 1987.
I. Beinlich, H. Seurmondt, R. Chavez, and G. Cooper. The alarm monitoring system: a case study with two probabilistic inference techniques for belief networks. In Proceedings Artificial Intelligence in Medical Care, pages 247–256, London, 1989.
R.R. Bouckaert. Belief network construction using the minimum description length principle. Technical Report RUU-CS-93-??, To appear, Utrecht University, The Netherlands, 1992.
R.R. Bouckaert. Optimizing causal orderings for generating dags from data. In Proceedings Uncertainty in Artificial Intelligence, pages 9–16, 1992.
C.K. Chow and C.N. Liu. Approximating discrete probability distributions with dependency trees. IEEE Trans. on Information Theory, IT-14, pages 462–467, 1986.
G.F. Cooper and E. Herskovits. A bayesian method for the induction of probabilistic networks from data. Machine Learning, pages 309–347, 1992.
D. Heckerman, E. Horvitz, and B. Nathwani. Towards normative expert systems: Part I, the pathfinder project. Methods of Information in Medicine, 31:90–105, 1992.
M. Henrion. An introduction to algorithms for inference in belief nets. In Proceedings Uncertainty in Artificial Intelligence 5, pages 129–138, 1990.
E. Herskovits. Computer-based probabilistic-network construction. PhD thesis, Section of Medical Informatics, University of Pittsburgh, 1991.
S. Højsgaard and B. Thiesson. Bifrost-block recursive models induced from relevant knowledge, observationsm and statistical techniques. Technical Report R 92-2010, Institute for Electronic Systems, University of Aalborg, Denmark, June 1992.
S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their applications to expert systems (with discussion). J.R. Stat. Soc. (Series B),Vol. 50, pages 157–224, 1988.
S.L. Lauritzen, B. Thiesson, and D.J. Spiegelhalter. Diagnostic systems created by model selection methods — a case study. In Proceedings 4th International Workshop on AI and Statistics, 1993.
J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman, inc., San Mateo, CA, 1988.
G. Rebane and J. Pearl. The recovery of causal polytrees from statistical data. In Proceedings Uncertainty in Artificial Intelligence, pages 222–228, 1987.
J. Rissanen. Stochastic complexity and modeling. Annals of Statistics, 14(3):1080–1100, 1986.
J. Rissanen. Stochastic complexity. Journal of the Royal Statistical Society B, 49(3):223–239, 1987.
R.D. Robinson. Counting unlabeled acyclic digraphs. In Proceedings of the fifth Australian Conference on Combinatorial Mathematics, pages 28–43, Melbourn, Australia, 1976.
M.A. Shwe, B. Middleton, D.E. Heckerman, M. Henrion, E. Horvitz, H. Lehmann, and G. Cooper. Probabilistic diagnosis using a reformulation of the internist-1/qmr knowledge base: I the probabilistic modal and inference algorithms. Methods of Information in Medicine, 30:241–255, 1991.
P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction, and Search. To appear, 1993.
T. Verma and J. Pearl. Causal networks: Semantics and expressiveness. In Proceedings Uncertainty in Artificial Intelligence, pages 352–359, 1988.
N. Wermuth and S.L. Lauritzen. Graphical and recursive models for contingency tables. Biometrika, 72:537–552, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouckaert, R.R. (1993). Probabilistic network construction using the minimum description length principle. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028180
Download citation
DOI: https://doi.org/10.1007/BFb0028180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57395-1
Online ISBN: 978-3-540-48130-0
eBook Packages: Springer Book Archive