{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:30:07Z","timestamp":1758400207264,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221514"},{"type":"electronic","value":"9783642221521"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22152-1_17","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T19:22:00Z","timestamp":1309029720000},"page":"194-205","source":"Crossref","is-referenced-by-count":2,"title":["Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes"],"prefix":"10.1007","author":[{"given":"Juan I.","family":"Alonso-Barba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"de la Ossa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose A.","family":"G\u00e1mez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose M.","family":"Puerta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0169-2070(95)00664-8","volume":"12","author":"B. Abramson","year":"1996","unstructured":"Abramson, B., Brown, J., Edwards, W., Murphy, A., Winkler, R.L.: Hailfinder: A Bayesian system for forecasting severe weather. Int. J. Forecasting\u00a012(1), 57\u201371 (1996)","journal-title":"Int. J. Forecasting"},{"key":"17_CR2","first-page":"52","volume-title":"UAI 1991","author":"W. Buntine","year":"1991","unstructured":"Buntine, W.: Theory refinement on Bayesian networks. In: UAI 1991, pp. 52\u201360. Morgan Kaufmann Publishers Inc., San Francisco (1991)"},{"key":"17_CR3","first-page":"507","volume":"3","author":"D. Chickering","year":"2002","unstructured":"Chickering, D.: Optimal structure identification with greedy search. J. Mach. Learn. Res.\u00a03, 507\u2013554 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR4","unstructured":"Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian networks: Search methods and experimental results. In: Proc. AISTATS 1995, pp. 112\u2013128 (1995)"},{"key":"17_CR5","unstructured":"Friedman, N., Nachman, I., Pe\u2019er, D.: Learning Bayesian network structure from massive datasets: The \u201dSparse Candidate\u201d algorithm. In: UAI 1999, pp. 206\u2013215 (1999)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"G\u00e1mez, J.A., Mateo, J.L., Puerta, J.M.: Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood. Data Min. Knowl. Disc. (2010), doi:10.1007\/s10618\u2013010\u20130178\u20136 (to appear)","DOI":"10.1007\/s10618-010-0178-6"},{"issue":"3","key":"17_CR7","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.\u00a020(3), 197\u2013243 (1995)","journal-title":"Mach. Learn."},{"key":"17_CR8","volume-title":"Learning Bayesian Networks","author":"R. Neapolitan","year":"2003","unstructured":"Neapolitan, R.: Learning Bayesian Networks. Prentice-Hall, Englewood Cliffs (2003)"},{"key":"17_CR9","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of plausible inference. Morgan Kaufmann, San Francisco (1988)"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10994-006-6889-7","volume":"65","author":"I. Tsamardinos","year":"2006","unstructured":"Tsamardinos, I., Brown, L.E., Aliferis, C.F.: The max-min hill-climbing Bayesian network structure learning algorithm. Mach. Learn.\u00a065(1), 31\u201378 (2006)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22152-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T06:13:12Z","timestamp":1560319992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22152-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221514","9783642221521"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22152-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}