{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:21:10Z","timestamp":1743074470890,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319208060"},{"type":"electronic","value":"9783319208077"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20807-7_29","type":"book-chapter","created":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T08:12:50Z","timestamp":1436602370000},"page":"325-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Every LWF and AMP Chain Graph Originates from a Set of Causal Models"],"prefix":"10.1007","author":[{"given":"Jose M.","family":"Pe\u00f1a","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,12]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1111\/1467-9469.00224","volume":"28","author":"SA Andersson","year":"2001","unstructured":"Andersson, S.A., Madigan, D., Perlman, M.D.: Alternative Markov properties for chain graphs. Scand. J. Stat. 28, 33\u201385 (2001)","journal-title":"Scand. J. Stat."},{"key":"29_CR2","unstructured":"Bendtsen, M., Pe\u00f1a, J.M.: Gated Bayesian networks. In: Proceedings of the 12th Scandinavian Conference on Artificial Intelligence, pp. 35\u201344 (2013)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-319-11433-0_4","volume-title":"Probabilistic Graphical Models","author":"M Bendtsen","year":"2014","unstructured":"Bendtsen, M., Pe\u00f1a, J.M.: Learning Gated Bayesian networks for algorithmic trading. In: van der Gaag, L.C., Feelders, A.J. (eds.) PGM 2014. LNCS, vol. 8754, pp. 49\u201364. Springer, Heidelberg (2014)"},{"key":"29_CR4","unstructured":"Bonduelle, Y.: Aggregating expert opinions by resolving sources of disagreement. Ph.D. thesis, Stanford University (1987)"},{"key":"29_CR5","unstructured":"Chickering, D.M., Meek, C.: Finding optimal Bayesian networks. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, pp. 94\u2013102 (2002)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1214\/ss\/1177010887","volume":"8","author":"DR Cox","year":"1993","unstructured":"Cox, D.R., Wermuth, N.: Linear dependencies represented by chain graphs. Stat. Sci. 8, 204\u2013218 (1993)","journal-title":"Stat. Sci."},{"key":"29_CR7","volume-title":"Multivariate Dependencies - Models - Analysis and Interpretation","author":"DR Cox","year":"1996","unstructured":"Cox, D.R., Wermuth, N.: Multivariate Dependencies - Models - Analysis and Interpretation. Chapman & Hall, London (1996)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/int.10086","volume":"18","author":"J del Sagrado","year":"2003","unstructured":"del Sagrado, J., Moral, S.: Qualitative combination of Bayesian networks. Int. J. Intell. Syst. 18, 237\u2013249 (2003)","journal-title":"Int. J. Intell. Syst."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"736","DOI":"10.3150\/08-BEJ172","volume":"15","author":"M Drton","year":"2009","unstructured":"Drton, M.: Discrete chain graph models. Bernoulli 15, 736\u2013753 (2009)","journal-title":"Bernoulli"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/j.ijar.2012.12.002","volume":"54","author":"K Etminani","year":"2013","unstructured":"Etminani, K., Naghibzadeh, M., Pe\u00f1a, J.M.: DemocraticOP: a democratic way of aggregating Bayesian network parameters. Int. J. Approximate Reasoning 54, 602\u2013614 (2013)","journal-title":"Int. J. Approximate Reasoning"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.jspi.2004.03.012","volume":"133","author":"J Ferrandiz","year":"2005","unstructured":"Ferrandiz, J., Castillo, E., Sanmartin, P.: Temporal aggregation in chain graph models. J. Stat. Planning Infer. 133, 69\u201393 (2005)","journal-title":"J. Stat. Planning Infer."},{"key":"29_CR12","first-page":"333","volume":"17","author":"M Frydenberg","year":"1990","unstructured":"Frydenberg, M.: The chain graph Markov property. Scand. J. Stat. 17, 333\u2013353 (1990)","journal-title":"Scand. J. Stat."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF00486109","volume":"36","author":"R Laddaga","year":"1977","unstructured":"Laddaga, R.: Lehrer and the consensus proposal. Synthese 36, 473\u2013477 (1977)","journal-title":"Synthese"},{"key":"29_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical Models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen, S.L.: Graphical Models. Oxford University Press, Oxford (1996)"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1111\/1467-9868.00340","volume":"64","author":"SL Lauritzen","year":"2002","unstructured":"Lauritzen, S.L., Richardson, T.S.: Chain graph models and their causal interpretations. J. Roy. Stat. Soc. B 64, 321\u2013361 (2002)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1214\/aos\/1176347003","volume":"17","author":"SL Lauritzen","year":"1989","unstructured":"Lauritzen, S.L., Wermuth, N.: Graphical models for associations between variables, some of which are qualitative and some quantitative. Annu. Stat. 17, 31\u201357 (1989)","journal-title":"Annu. Stat."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1214\/aos\/1015345961","volume":"29","author":"M Levitz","year":"2001","unstructured":"Levitz, M., Perlman, M.D., Madigan, D.: Separation and completeness properties for AMP chain graph Markov models. Ann. Stat. 29, 1751\u20131784 (2001)","journal-title":"Ann. Stat."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Matzkevich, I., Abramson, B.: The topological fusion of Bayes nets. In: Proceedings of the 8th Conference on Uncertainty in Artificial Intelligence, pp. 191\u2013198 (1992)","DOI":"10.1016\/B978-1-4832-8287-9.50031-1"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Matzkevich, I., Abramson, B.: Some complexity considerations in the combination of Belief networks. In: Proceedings of the 9th Conference on Uncertainty in Artificial Intelligence, pp. 152\u2013158 (1993)","DOI":"10.1016\/B978-1-4832-1451-1.50023-8"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Matzkevich, I., Abramson, B.: Deriving a minimal I-Map of a belief network relative to a target ordering of its nodes. In: Proceedings of the 9th Conference on Uncertainty in Artificial Intelligence, pp. 159\u2013165 (1993)","DOI":"10.1016\/B978-1-4832-1451-1.50024-X"},{"key":"29_CR21","unstructured":"Maynard-Reid II, P., Chajewska, U.: Agregating learned probabilistic beliefs. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pp. 354\u2013361 (2001)"},{"key":"29_CR22","unstructured":"Nielsen, J.D., Ko\u010dka, T., Pe\u00f1a, J.M.: On local optima in learning Bayesian networks. In: Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence, pp. 435\u2013442 (2003)"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.artint.2007.04.005","volume":"171","author":"SH Nielsen","year":"2007","unstructured":"Nielsen, S.H., Parsons, S.: An application of formal argumentation: fusing Bayesian networks in multi-agent systems. Artif. Intell. 171, 754\u2013775 (2007)","journal-title":"Artif. Intell."},{"key":"29_CR24","volume-title":"Causality: Models, Reasoning, and Inference","author":"J Pearl","year":"2000","unstructured":"Pearl, J.: Causality: Models, Reasoning, and Inference. Cambridge University Press, Cambridge (2000)"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/deca.1050.0048","volume":"2","author":"DM Pennock","year":"2005","unstructured":"Pennock, D.M., Wellman, M.P.: Graphical models for groups: belief aggregation and risk sharing. Decis. Anal. 2, 148\u2013164 (2005)","journal-title":"Decis. Anal."},{"key":"29_CR26","unstructured":"Pe\u00f1a, J.M.: Approximate counting of graphical models via MCMC. In: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, pp. 352\u2013359 (2007)"},{"key":"29_CR27","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1016\/j.ijar.2009.06.006","volume":"50","author":"JM Pe\u00f1a","year":"2009","unstructured":"Pe\u00f1a, J.M.: Faithfulness in chain graphs: the discrete case. Int. J. Approximate Reasoning 50, 1306\u20131313 (2009)","journal-title":"Int. J. Approximate Reasoning"},{"key":"29_CR28","unstructured":"Pe\u00f1a, J.M.: Faithfulness in chain graphs: the Gaussian case. In: Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, pp. 588\u2013599 (2011)"},{"key":"29_CR29","first-page":"661","volume":"42","author":"JM Pe\u00f1a","year":"2011","unstructured":"Pe\u00f1a, J.M.: Finding consensus Bayesian network structures. J. Artif. Intell. Res. 42, 661\u2013687 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"29_CR30","unstructured":"Pe\u00f1a, J.M.: Learning AMP chain graphs under faithfulness. In: Proceedings of the 6th European Workshop on Probabilistic Graphical Models, pp. 251\u2013258 (2012)"},{"key":"29_CR31","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.ijar.2014.03.003","volume":"55","author":"JM Pe\u00f1a","year":"2014","unstructured":"Pe\u00f1a, J.M.: Marginal AMP chain graphs. Int. J. Approximate Reasoning 55, 1185\u20131206 (2014)","journal-title":"Int. J. Approximate Reasoning"},{"key":"29_CR32","unstructured":"Pe\u00f1a, J.M., Sonntag, D., Nielsen, J.D. An inclusion optimal algorithm for chain graph structure learning. In: Proceedings of the 17th International Conference on Artificial Intelligence and Statistics, pp. 778\u2013786 (2014)"},{"key":"29_CR33","doi-asserted-by":"crossref","unstructured":"Raiffa, H.: Decision Analysis: Introductory Lectures on Choices under Uncertainty. Addison-Wesley, Reading (1968)","DOI":"10.2307\/2987280"},{"key":"29_CR34","doi-asserted-by":"crossref","unstructured":"Richardson, T.S.: Chain Graphs and Symmetric Associations. In: Learning in Graphical Models, pp. 231\u2013260 (1998)","DOI":"10.1007\/978-94-011-5014-9_9"},{"key":"29_CR35","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1214\/aos\/1031689015","volume":"30","author":"T Richardson","year":"2002","unstructured":"Richardson, T., Spirtes, P.: Ancestral graph Markov models. Ann. Stat. 30, 962\u20131030 (2002)","journal-title":"Ann. Stat."},{"key":"29_CR36","doi-asserted-by":"publisher","first-page":"676","DOI":"10.3150\/12-BEJ502","volume":"20","author":"K Sadeghi","year":"2014","unstructured":"Sadeghi, K., Lauritzen, S.L.: Markov properties for mixed graphs. Bernoulli 20, 676\u2013696 (2014)","journal-title":"Bernoulli"},{"key":"29_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-642-39091-3_43","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"D Sonntag","year":"2013","unstructured":"Sonntag, D., Pe\u00f1a, J.M.: Chain graph interpretations and their relations. In: van der Gaag, L.C. (ed.) ECSQARU 2013. LNCS, vol. 7958, pp. 510\u2013521. Springer, Heidelberg (2013)"},{"key":"29_CR38","unstructured":"Studen\u00fd, M.: Bayesian networks from the point of view of chain graphs. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 496\u2013503 (1998)"},{"key":"29_CR39","unstructured":"Studen\u00fd, M.: Probabilistic Conditional Independence Structures. Springer, Heidelberg (2005)"},{"key":"29_CR40","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1214\/aos\/1024691250","volume":"26","author":"M Studen\u00fd","year":"1998","unstructured":"Studen\u00fd, M., Bouckaert, R.R.: On chain graph models for description of conditional independence structures. Ann. Stat. 26, 1434\u20131495 (1998)","journal-title":"Ann. Stat."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20807-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T23:04:01Z","timestamp":1717974241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20807-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319208060","9783319208077"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20807-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"12 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}