{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:01:04Z","timestamp":1781002864732,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,6]],"date-time":"2010-11-06T00:00:00Z","timestamp":1289001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10479-010-0814-y","type":"journal-article","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T16:34:40Z","timestamp":1288974880000},"page":"71-90","source":"Crossref","is-referenced-by-count":16,"title":["Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution"],"prefix":"10.1007","volume":"193","author":[{"given":"Tam\u00e1s","family":"Sz\u00e1ntai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edith","family":"Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,6]]},"reference":[{"key":"814_CR1","first-page":"979","volume-title":"6-th international conference IPMU","author":"S. Acid","year":"1996","unstructured":"Acid, S., & Campos, L. M. (1996a). BENEDICT: an algorithm for learning probabilistic networks. In 6-th international conference IPMU (pp. 979\u2013984)."},{"key":"814_CR2","first-page":"3","volume-title":"Proceedings of 12th conference on uncertainty in artificial intelligence","author":"S. Acid","year":"1996","unstructured":"Acid, S., & Campos, L. M. (1996b). An algorithm for finding minimum d separating sets in belief networks. In Proceedings of 12th conference on uncertainty in artificial intelligence (pp. 3\u201310). San Mateo: Morgan Kaufman."},{"key":"814_CR3","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1239\/aap\/999188323","volume":"33","author":"J. Buksz\u00e1r","year":"2001","unstructured":"Buksz\u00e1r, J. (2001). Upper bounds for the probability of union by multitrees. Advances in Applies Probability, 33, 437\u2013452.","journal-title":"Advances in Applies Probability"},{"key":"814_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1287\/moor.26.1.174.10596","volume":"26","author":"J. Buksz\u00e1r","year":"2001","unstructured":"Buksz\u00e1r, J., & Pr\u00e9kopa, A. (2001). Probability bounds with cherry trees. Mathematics of Operational Research, 26, 174\u2013192.","journal-title":"Mathematics of Operational Research"},{"key":"814_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1080\/1055678021000033955","volume":"17","author":"J. Buksz\u00e1r","year":"2002","unstructured":"Buksz\u00e1r, J., & Sz\u00e1ntai, T. (2002). Probability bounds given by hypercherry trees. Optimization Methods and Software, 17, 409\u2013422.","journal-title":"Optimization Methods and Software"},{"key":"814_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2270-5","volume-title":"Expert systems and probabilistic network models","author":"E. Castillo","year":"1997","unstructured":"Castillo, E., Gutierrez, J., & Hadi, A. (1997). Expert systems and probabilistic network models. Berlin: Springer."},{"key":"814_CR7","first-page":"83","volume-title":"Proceedings of AI&StAT\u201997","author":"J. Cheng","year":"1997","unstructured":"Cheng, J., Bell, D. A., & Liu, W. (1997). An algorithm for Bayesian belief network construction from data. In Proceedings of AI&StAT\u201997 (pp. 83\u201390)."},{"key":"814_CR8","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. K. Chow","year":"1968","unstructured":"Chow, C. K., & Liu, C. N. (1968). Approximating discrete probability distribution with dependence tree. IEEE Transactions on Informational Theory, 14, 462\u2013467.","journal-title":"IEEE Transactions on Informational Theory"},{"key":"814_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T. M. Cover","year":"1991","unstructured":"Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley-Interscience."},{"key":"814_CR10","volume-title":"Probabilistic networks and expert systems. Statistics for engineering and information science","author":"R. G. Cowell","year":"1999","unstructured":"Cowell, R. G., Dawid, A. Ph., Lauritzen, S. L., & Spiegelhalter, D. J. (1999). Probabilistic networks and expert systems. Statistics for engineering and information science. Berlin: Springer."},{"key":"814_CR11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1214\/aop\/1176996454","volume":"3","author":"I. Csisz\u00e1r","year":"1975","unstructured":"Csisz\u00e1r, I. (1975). I-divergence geometry of probability distributions and minimization problems. The Annals of Probability, 3, 146\u2013158.","journal-title":"The Annals of Probability"},{"key":"814_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0888-613X(99)00042-0","volume":"24","author":"L. M. Campos de","year":"2000","unstructured":"de Campos, L. M., & Huete, J. F. (2000). A new approach for learning belief networks using independence criteria. International Journal of Approximate Reasoning, 24, 11\u201337.","journal-title":"International Journal of Approximate Reasoning"},{"key":"814_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68282-2","volume-title":"Bayesian networks and decision graphs, information science and statistics","author":"F. V. Jensen","year":"2007","unstructured":"Jensen, F. V., & Nielsen, T. D. (2007). Bayesian networks and decision graphs, information science and statistics (2nd edn.). New York: Springer.","edition":"2"},{"key":"814_CR14","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-642-03735-1_3","volume-title":"Coping with uncertainty, modeling and policy issues. Proceedings of the IFIP\/IIASA\/GAMM workshop on \u201cCoping with uncertainty\u201d, held at the International Institute for Systems Analysis","author":"E. Kov\u00e1cs","year":"2010","unstructured":"Kov\u00e1cs, E., & Sz\u00e1ntai, T. (2010). On the approximation of a multivariate distribution using the new concept of t-cherry junction tree. In K. Marti, Y. Ermoliev, M. Makowski, & G. Pflug (Eds.), Lecture Notes in Economics and Mathematical Systems: Vol. 581. Coping with uncertainty, modeling and policy issues. Proceedings of the IFIP\/IIASA\/GAMM workshop on \u201cCoping with uncertainty\u201d, held at the International Institute for Systems Analysis (pp. 39\u201356). IIASA, Laxenburg, Austria, 10\u201312 December, 2007. Berlin: Springer."},{"key":"814_CR15","volume-title":"Information theory and statistics","author":"S. Kullback","year":"1959","unstructured":"Kullback, S., & Leibler, R. A. (1959). Information theory and statistics. New York: Wiley and Sons."},{"issue":"2","key":"814_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. L. Lauritzen","year":"1988","unstructured":"Lauritzen, S. L., & Spiegelhalter, D. J. (1988). Local computations with probabilities on graphical structures and their applications to expert systems. Journal of Royal Statistical Society Series\u00a0B, 50(2), 157\u2013224.","journal-title":"Journal of Royal Statistical Society Series\u00a0B"},{"key":"814_CR17","volume-title":"Probabilistic reasoning in intelligent system","author":"J. Pearl","year":"1997","unstructured":"Pearl, J. (1997). Probabilistic reasoning in intelligent system (2nd printing). San Mateo: Morgan Kaufmann."},{"key":"814_CR18","series-title":"Broad research in artificial intelligence and neuroscience (BRAIN)","first-page":"40","volume-title":"Special issue on complexity in sciences and artificial intelligence","author":"T. Sz\u00e1ntai","year":"2010","unstructured":"Sz\u00e1ntai, T., & Kov\u00e1cs, E. (2010). Application of t-cherry junction trees in pattern recognition. In B. Iantovics, D. Radoiu, M. Marusteri, & M. Dehmer (Eds.), Broad research in artificial intelligence and neuroscience (BRAIN): Vol. 1. Special issue on complexity in sciences and artificial intelligence (pp. 40\u201345)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0814-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0814-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0814-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T16:32:25Z","timestamp":1740673945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0814-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["814"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0814-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,6]]}}}