{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:43:11Z","timestamp":1742989391418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319283784"},{"type":"electronic","value":"9783319283791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28379-1_4","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:55:31Z","timestamp":1452182131000},"page":"46-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hashing-Based Hybrid Duplicate Detection for Bayesian Network Structure Learning"],"prefix":"10.1007","author":[{"given":"Niklas","family":"Jahnsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brandon","family":"Malone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petri","family":"Myllym\u00e4ki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"4_CR1","unstructured":"Bartlett, M., Cussens, J.: Integer linear programming for the Bayesian network structure learning problem. Artif. Intell. (2015)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-1-4612-2404-4_12","volume-title":"Learning from Data: Artificial Intelligence and Statistics V","author":"DM Chickering","year":"1996","unstructured":"Chickering, D.M.: Learning Bayesian networks is NP-complete. In: Fisher, D., Lenz, H.-J. (eds.) Learning from Data: Artificial Intelligence and Statistics V, pp. 121\u2013130. Springer, New York (1996)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00994110","volume":"9","author":"GF Cooper","year":"1992","unstructured":"Cooper, G.F., Herskovits, E.: A Bayesian method for the induction of probabilistic networks from data. Mach. Learn. 9, 309\u2013347 (1992)","journal-title":"Mach. Learn."},{"key":"4_CR4","first-page":"663","volume":"12","author":"CP de Campos","year":"2011","unstructured":"de Campos, C.P., Ji, Q.: Efficient learning of Bayesian networks using constraints. J. Mach. Learn. Res. 12, 663\u2013689 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0888-613X(99)00042-0","volume":"24","author":"LM de Campos","year":"2000","unstructured":"de Campos, L.M., Huete, J.F.: A new approach for learning belief networks using independence criteria. Int. J. Approximate Reasoning 24(1), 11\u201337 (2000)","journal-title":"Int. J. Approximate Reasoning"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Fan, X., Yuan, C., Malone, B.: Tightening bounds for Bayesian network structure learning. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.9061"},{"key":"4_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00994016","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, 197\u2013243 (1995)","journal-title":"Mach. Learn."},{"key":"4_CR9","unstructured":"Johnson, D.: Near-Optimal Bin Packing Algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)"},{"key":"4_CR10","first-page":"549","volume":"5","author":"M Koivisto","year":"2004","unstructured":"Koivisto, M., Sood, K.: Exact Bayesian structure discovery in Bayesian networks. J. Mach. Learn. Res. 5, 549\u2013573 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR11","unstructured":"Korf, R.E.: A new algorithm for optimal bin packing. In: Proceedings of the 18th AAAI Conference on Artificial Intelligence (2002)"},{"key":"4_CR12","unstructured":"Korf, R.E. Best-first frontier search with delayed duplicate detection. In: Proceedings of the 19th AAAI Conference on Artificial Intelligence (2004)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Korf, R.E.: Linear-time disk-based implicit graph search. J. ACM 35(6) (2008)","DOI":"10.1145\/1455248.1455250"},{"key":"4_CR14","unstructured":"Malone, B., J\u00e4rvisalo, M., Myllym\u00e4ki, P.: Impact of learning strategies on the qual packing Bayesian networks: an empirical evaluation. In: Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (2015)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Malone, B., Kangas, K., J\u00e4rvisalo, M., Koivisto, M., Myllym\u00e4ki, P.: Predicting the hardness of learning Bayesian networks. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.9075"},{"key":"4_CR16","unstructured":"Malone, B., Yuan, C.: Evaluating anytime algorithms for learning optimal Bayesian networks. In: Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence (2013)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-04534-4_8","volume-title":"Graph Structures for Knowledge Representation and Reasoning","author":"B Malone","year":"2014","unstructured":"Malone, B., Yuan, C.: A depth-first branch and bound algorithm for learning optimal Bayesian networks. In: Croitoru, M., Rudolph, S., Woltran, S., Gonzales, C. (eds.) GKR 2013. LNCS, vol. 8323, pp. 111\u2013122. Springer, Heidelberg (2014)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Malone, B., Yuan, C., Hansen, E.: Memory-efficient dynamic programming for learning optimal Bayesian networks. In: Proceedings of the 25th AAAI Conference on Artifical Intelligence (2011)","DOI":"10.1609\/aaai.v25i1.8024"},{"key":"4_CR19","unstructured":"Ott, S., Imoto, S., Miyano, S.: Finding optimal models for small gene networks. In: Proceedings of the Pacific Symposium on Biocomputing (2004)"},{"key":"4_CR20","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 Publishers Inc., San Mateo (1988)"},{"key":"4_CR21","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2003","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson Education, Upper Saddle River (2003)"},{"key":"4_CR22","unstructured":"Silander, T., Myllym\u00e4ki, P.: A simple approach for finding the globally optimal Bayesian network structure. In: Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence (2006)"},{"key":"4_CR23","unstructured":"Silander, T., Roos, T., Kontkanen, P., Myllym\u00e4ki, P.: Factorized normalized maximum likelihood criterion for learning Bayesian network structures. In: Proceedings of the 4th European Workshop on Probabilistic Graphical Models (2008)"},{"issue":"2","key":"4_CR24","first-page":"356","volume":"E82\u2013D","author":"J Suzuki","year":"1999","unstructured":"Suzuki, J.: Learning Bayesian belief networks based on the MDL principle: an efficient algorithm using the branch and bound technique. IEICE Trans. Inf. Syst. E82\u2013D(2), 356\u2013367 (1999)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"4_CR25","first-page":"2437","volume":"12","author":"Y Tamada","year":"2011","unstructured":"Tamada, Y., Imoto, S., Miyano, S.: Parallel algorithm for learning optimal Bayesian network structure. J. Mach. Learn. Res. 12, 2437\u20132459 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR26","unstructured":"Teyssier, M., Koller, D.: Ordering-based search: a simple and effective algorithm for learning Bayesian networks. In: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (2005)"},{"key":"4_CR27","unstructured":"Tian, J.: A branch-and-bound algorithm for MDL learning Bayesian networks. In: Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (2000)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-319-23219-5_31","volume-title":"Principles and Practice of Constraint Programming","author":"P van Beek","year":"2015","unstructured":"van Beek, P., Hoffmann, H.-F.: Machine learning of Bayesian networks using constraint programming. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 429\u2013445. Springer, Heidelberg (2015)"},{"key":"4_CR29","unstructured":"Yuan, C., Malone, B.: An improved admissible heuristic for finding optimal Bayesian networks. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (2012)"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1613\/jair.4039","volume":"48","author":"C Yuan","year":"2013","unstructured":"Yuan, C., Malone, B.: Learning optimal Bayesian networks: a shortest path perspective. J. Artif. Intell. Res. 48, 23\u201365 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR31","unstructured":"Zhou, R., Hansen, E. A.: Sparse-memory graph search. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (2003)"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.artint.2005.12.002","volume":"170","author":"R Zhou","year":"2006","unstructured":"Zhou, R., Hansen, E.A.: Breadth-first heuristic search. Artif. Intell. 170, 385\u2013408 (2006)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Advanced Methodologies for Bayesian Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28379-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T07:13:31Z","timestamp":1700205211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-28379-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319283784","9783319283791"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28379-1_4","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":"8 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}