{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:45:27Z","timestamp":1725749127001},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406423"},{"type":"electronic","value":"9783642406430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40643-0_32","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T04:50:01Z","timestamp":1379479801000},"page":"310-320","source":"Crossref","is-referenced-by-count":1,"title":["Learning more Accurate Bayesian Networks in the CHC Approach by Adjusting the Trade-Off between Efficiency and Accuracy"],"prefix":"10.1007","author":[{"given":"Jacinto","family":"Arias","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 A.","family":"G\u00e1mez","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 M.","family":"Puerta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Alonso-Barba, J.: delaOssa, L., G\u00e1mez, J., Puerta, J.: Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes. International Journal of Approximate Reasoning (2013)","DOI":"10.1016\/j.ijar.2012.09.004"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Chickering, D.M.: Learning bayesian networks is NP-complete. In: Learning from data, pp. 121\u2013130. Springer (1996)","DOI":"10.1007\/978-1-4612-2404-4_12"},{"issue":"1-2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10618-010-0178-6","volume":"22","author":"J. G\u00e1mez","year":"2011","unstructured":"G\u00e1mez, J., Mateo, J., Puerta, J.: Learning bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood. Data Mining and Knowledge Discovery\u00a022(1-2), 106\u2013148 (2011)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s13748-012-0033-7","volume":"1","author":"J. G\u00e1mez","year":"2012","unstructured":"G\u00e1mez, J., Mateo, J., Puerta, J.: One iteration CHC algorithm for learning Bayesian networks: an effective and efficient algorithm for high dimensional problems. Progress in Artificial Intelligence\u00a01(4), 329\u2013346 (2012)","journal-title":"Progress in Artificial Intelligence"},{"key":"32_CR5","unstructured":"G\u00e1mez, J., Salmer\u00f3n, A., Cano, A.: Design of new algorithms for probabilistic graphical models. Implementation in Elvira. Programo Research Project (TIN2007-67418-c03) (2010)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Heckerman, D., Geiger, D., Chickering, D.M.: Learning bayesian networks: The combination of knowledge and statistical data. Machine Learning 20(3) (1995)","DOI":"10.1007\/BF00994016"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Jensen, F.V., Nielsen, T.D.: Bayesian networks and decision graphs. Springer (2007)","DOI":"10.1007\/978-0-387-68282-2"},{"key":"32_CR8","unstructured":"Neapolitan, R.E.: Learning bayesian networks. Pearson Prentice Hall (2004)"},{"key":"32_CR9","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausble Inference. Morgan Kaufmann Pub. (1988)"},{"issue":"1","key":"32_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., Aliferis, C.: The max-min hill-climbing bayesian network structure learning algorithm. Machine Learning\u00a065(1), 31\u201378 (2006)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40643-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T07:00:34Z","timestamp":1558076434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40643-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406423","9783642406430"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40643-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}