{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:34:48Z","timestamp":1743129288218,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876258"},{"type":"electronic","value":"9783030876265"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87626-5_20","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T06:14:35Z","timestamp":1632896075000},"page":"271-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recent Advances in Counting and Sampling Markov Equivalent DAGs"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Wien\u00f6bst","sequence":"first","affiliation":[]},{"given":"Max","family":"Bannach","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"20_CR1","unstructured":"AhmadiTeshnizi, A., Salehkaleybar, S., Kiyavash, N.: Lazyiter: a fast algorithm for counting Markov equivalent DAGs and designing experiments. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020 (2020)"},{"issue":"2","key":"20_CR2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1214\/aos\/1031833662","volume":"25","author":"SA Andersson","year":"1997","unstructured":"Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat. 25(2), 505\u2013541 (1997)","journal-title":"Ann. Stat."},{"key":"20_CR3","first-page":"445","volume":"2","author":"DM Chickering","year":"2002","unstructured":"Chickering, D.M.: Learning equivalence classes of Bayesian-network structures. J. Mach. Learn. Res. 2, 445\u2013498 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR4","first-page":"507","volume":"3","author":"DM Chickering","year":"2002","unstructured":"Chickering, D.M.: Optimal structure identification with greedy search. J. Mach. Learn. Res. 3, 507\u2013554 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hamm, T., Talvitie, T.: An efficient algorithm for counting Markov equivalent dags. In: Proccedings of the 34th Conference on Artificial Intelligence, AAAI 2020, pp. 10136\u201310143 (2020)","DOI":"10.1609\/aaai.v34i06.6573"},{"key":"20_CR6","unstructured":"Ghassami, A., Salehkaleybar, S., Kiyavash, N., Bareinboim, E.: Budgeted experiment design for causal structure learning. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018, pp. 1719\u20131728 (2018)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ghassami, A., Salehkaleybar, S., Kiyavash, N., Zhang, K.: Counting and sampling from Markovv equivalent dags using clique trees. In: Proceedings of the 33th Conference on Artificial Intelligence, AAAI 2019, pp. 3664\u20133671 (2019)","DOI":"10.1609\/aaai.v33i01.33013664"},{"key":"20_CR8","first-page":"2409","volume":"13","author":"A Hauser","year":"2012","unstructured":"Hauser, A., B\u00fchlmann, P.: Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs. J. Mach. Learn. Res. 13, 2409\u20132464 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR9","unstructured":"He, Y.B., Geng, Z.: Active learning of causal networks with intervention experiments and optimal designs. J. Mach. Learn. Res. 9(Nov), 2523\u20132547 (2008)"},{"issue":"79","key":"20_CR10","first-page":"2589","volume":"16","author":"Y He","year":"2015","unstructured":"He, Y., Jia, J., Yu, B.: Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs. J. Mach. Learn. Res. 16(79), 2589\u20132609 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"20_CR11","first-page":"197","volume":"20","author":"D Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Mach. Learn. 20(3), 197\u2013243 (1995)","journal-title":"Mach. Learn."},{"key":"20_CR12","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models - Principles and Techniques. MIT Press, Cambridge (2009)"},{"issue":"6A","key":"20_CR13","doi-asserted-by":"publisher","first-page":"3133","DOI":"10.1214\/09-AOS685","volume":"37","author":"MH Maathuis","year":"2009","unstructured":"Maathuis, M.H., Kalisch, M., B\u00fchlmann, P.: Estimating high-dimensional intervention effects from observational data. Ann. Stat. 37(6A), 3133\u20133164 (2009)","journal-title":"Ann. Stat."},{"issue":"11","key":"20_CR14","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1080\/03610929608831853","volume":"25","author":"D Madigan","year":"1996","unstructured":"Madigan, D., Andersson, S.A., Perlman, M.D., Volinsky, C.T.: Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Commun. Stat. Theory Methods 25(11), 2493\u20132519 (1996)","journal-title":"Commun. Stat. Theory Methods"},{"key":"20_CR15","unstructured":"Meek, C.: Causal inference and causal explanation with background knowledge. In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, UAI 1995, pp. 403\u2013410 (1995)"},{"key":"20_CR16","unstructured":"Meek, C.: Graphical Models: Selecting Causal and Statistical Models. Ph.D. thesis, Carnegie Mellon University (1997)"},{"key":"20_CR17","unstructured":"Pearl, J.: Causality. Cambridge University Press, Cambridge (2009)"},{"key":"20_CR18","unstructured":"Perkovi\u0107, E., Textor, J., Kalisch, M., Maathuis, M.H.: Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs. J. Mach. Learn. Res. 18, 220:1\u2013220:62 (2017)"},{"key":"20_CR19","unstructured":"Shanmugam, K., Kocaoglu, M., Dimakis, A.G., Vishwanath, S.: Learning causal graphs with small interventions. In: Processing of the 28th Annual Conference on Neural Information Processing Systems, NIPS 2015, pp. 3195\u20133203 (2015)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search, Second Edition. MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/1754.001.0001"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Talvitie, T., Koivisto, M.: Counting and sampling Markov equivalent directed acyclic graphs. In: Proceedings of the 33th Conference on Artificial Intelligence, AAAI 2019, pp. 7984\u20137991 (2019)","DOI":"10.1609\/aaai.v33i01.33017984"},{"key":"20_CR22","unstructured":"Verma, T., Pearl, J.: Equivalence and synthesis of causal models. In: Proceedings of the 6th Annual Conference on Uncertainty in Artificial Intelligence, UAI 1990, pp. 255\u2013270 (1990)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Verma, T., Pearl, J.: An algorithm for deciding if a set of observed independencies has a causal explanation. In: Proceedings of the 8th Annual Conference on Uncertainty in Artificial Intelligence, UAI 1992, pp. 323\u2013330 (1992)","DOI":"10.1016\/B978-1-4832-8287-9.50049-9"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Wien\u00f6bst, M., Bannach, M., Li\u015bkiewicz, M.: Polynomial-time algorithms for counting and sampling Markov equivalent dags. In: Proccedings of the 35th Conference on Artificial Intelligence, AAAI 2021 (2021, in press)","DOI":"10.1007\/978-3-030-87626-5_20"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"van der Zander, B., Li\u015bkiewicz, M.: Separators and adjustment sets in Markov equivalent dags. In: Proceedings of the 30th Conference on Artificial Intelligence, AAAI 2016, pp. 3315\u20133321 (2016)","DOI":"10.1609\/aaai.v30i1.10424"}],"container-title":["Lecture Notes in Computer Science","KI 2021: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87626-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:24:13Z","timestamp":1673375053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87626-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876258","9783030876265"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87626-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2021.uni-luebeck.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}