Abstract
Most everyday reasoning and decision making is based on uncertain premises. The premises or attributes, which we must take into consideration, are random variables, so that we often have to deal with a high dimensional discrete multivariate random vector. We are going to construct an approximation of a high dimensional probability distribution that is based on the dependence structure between the random variables and on a special clustering of the graph describing this structure. Our method uses just one-, two- and three-dimensional marginal probability distributions. We give a formula that expresses how well the constructed approximation fits to the real probability distribution. We then prove that every time there exists a probability distribution constructed this way, that fits to reality at least as well as the approximation constructed from the Chow–Liu dependence tree. In the last part we give some examples that show how efficient is our approximation in application areas like pattern recognition and feature selection.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Acid, S., Campos, L.M.: BENEDICT: An algorithm for learning probabilistic belief networks. In: Sixth International Conference IPMU 1996, 979–984 (1996)
Acid, S., Campos, L.M.: An algorithm for finding minimum d-separating sets in belief networks. In: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, pp. 3–10. Morgan Kaufmann, San Mateo (1996)
Bukszár, J., Prékopa, A.: Probability bounds with cherry trees. Math. Oper. Res. 26, 174–192 (2001)
Bukszár, J., Szántai, T.: Probability bounds given by hypercherry trees. Optim. Methods Software 17, 409–422 (2002)
Castillo, E., Gutierrez, J., Hadi, A.: Expert Systems and Probabilistic Network Models. Springer, Berlin (1997)
Cheng, J., Bell, D.A., Liu, W.: An algorithm for Bayesian belief network construction from data. In: Proceedings of AI&StAT’97, 83–90 (1997)
Chow, C.K., Liu, C.N.: Approximating discrete probability distribution with dependence trees. IEEE Trans. Inform. Theory 14, 462–467 (1968)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)
Cowell, R.G., Dawid, A.Ph., Lauritzen, S.L., Spiegelhalter, D.J.: Probabilistic Networks and Expert Systems. Statistics for Engineering and Information Science. Springer, Berlin (1999)
Csiszar, I.: I-divergence geometry of probability distributions and minimization problems. Ann. Probab. 3, 146–158 (1975)
Huang, C., Darwiche, A.: Inference in belief networks: A procedural guide. Int. J. Approx. Reason. 15(3), 225–263 (1996)
Hutter, F., Ng, B., Dearden, R.: Incremental thin junction trees for dynamic Bayesian networks. Technical report, TR-AIDA-04-01, Intellectics Group, Darmstadt University of Technology, Germany, 2004. Preliminary version at http://www.fhutter.de/itjt.pdf
Jensen, F.V., Lauritzen, S.L., Olesen, K.: Bayesian updating in casual probabilistic networks by local computations. Comput. Stat. Q. 4 269–282 (1990)
Jensen, F.V., Nielsen, T.D.: Bayesian networks and decision graphs, 2nd edn. Information Science and Statistics. Springer, New York (2007)
Kullback, S.: Information Theory and Statistics. Wiley, New York (1959)
Acknowledgements
This work was partly supported by the grant No. T047340 of the Hungarian National Grant Office (OTKA).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kovács, E., Szántai, T. (2010). On the Approximation of a Discrete Multivariate Probability Distribution Using the New Concept of t-Cherry Junction Tree. In: Marti, K., Ermoliev, Y., Makowski, M. (eds) Coping with Uncertainty. Lecture Notes in Economics and Mathematical Systems, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03735-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-03735-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03734-4
Online ISBN: 978-3-642-03735-1
eBook Packages: Business and EconomicsBusiness and Management (R0)