{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T17:40:16Z","timestamp":1658252416205},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,21]],"date-time":"2016-12-21T00:00:00Z","timestamp":1482278400000},"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":["New Gener. Comput."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00354-016-0004-9","type":"journal-article","created":{"date-parts":[[2016,12,21]],"date-time":"2016-12-21T04:44:46Z","timestamp":1482295486000},"page":"47-67","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Duplicate Detection for Bayesian Network Structure Learning"],"prefix":"10.1007","volume":"35","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,12,21]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bartlett, M., Cussens, J.: Integer linear programming for the Bayesian network structure learning problem. Artif. Intell. (2015) (In press)","DOI":"10.1016\/j.artint.2015.03.003"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Chickering, D.M.: Learning Bayesian networks is NP-complete. In: Learning from Data: Artificial Intelligence and Statistics V, pp. 121\u2013130. Springer, Berlin (1996)","DOI":"10.1007\/978-1-4612-2404-4_12"},{"key":"4_CR3","first-page":"309","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 Campos de","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":"crossref","first-page":"11","DOI":"10.1016\/S0888-613X(99)00042-0","volume":"24","author":"LM Campos de","year":"2000","unstructured":"de Campos, L.M., Huete, J.F.: A new approach for learning belief networks using independence criteria. Int J Approx. Reason. 24(1), 11\u201337 (2000)","journal-title":"Int J Approx. Reason."},{"key":"4_CR6","unstructured":"Edelkamp, S., Schr\u00f6dl, S.: Heuristic Search: Theory and Applications. Morgan Kaufmann, San Francisco (2012)"},{"key":"4_CR7","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_CR8","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 and Co., New York (1979)"},{"key":"4_CR9","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, 197\u2013243 (1995)","journal-title":"Mach. Learn."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Jahnsson, N., Malone, B., Myllym\u00e4ki, P.: Hashing-based hybrid duplicate detection for Bayesian network structure learning. In: Advanced Methodologies for Bayesian Networks Workshop, vol. 9505 of LNAI, pp. 46\u201360. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-28379-1_4"},{"key":"4_CR11","unstructured":"Johnson, D.: Near-Optimal Bin Packing Algorithms. PhD thesis, Massachusetts Institute of Technology (1973)"},{"key":"4_CR12","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_CR13","unstructured":"Korf, R.E.: A new algorithm for optimal bin packing. In: Proceedings of the 18th AAAI Conference on Artificial Intelligence (2002)"},{"key":"4_CR14","unstructured":"Korf, R.E.: Best-first frontier search with delayed duplicate detection. In: Proceedings of the 19th AAAI Conference on Artifical Intelligence (2004)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Korf, R.E.: Linear-time disk-based implicit graph search. J. ACM 55(6), 26:1\u201326:40 (2008)","DOI":"10.1145\/1455248.1455250"},{"key":"4_CR16","unstructured":"Malone, B., J\u00e4rvisalo, M., Myllym\u00e4ki, P.: Impact of learning strategies on the quality of Bayesian networks: an empirical evaluation. In: Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (2015)"},{"key":"4_CR17","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_CR18","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_CR19","doi-asserted-by":"crossref","unstructured":"Malone, B., Yuan, C.: A depth-first branch and bound algorithm for learning optimal Bayesian networks. In: Graph Structures for Knowledge Representation and Reasoning, vol. 8323 of LNCS, pp. 111\u2013122. Springer (2014)","DOI":"10.1007\/978-3-319-04534-4_8"},{"key":"4_CR20","unstructured":"Malone, B., Yuan, C., Hansen, E., Bridges, S.: Improving the scalability of optimal Bayesian network learning with external-memory frontier breadth-first branch and bound search. In: Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (2011)"},{"key":"4_CR21","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_CR22","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"4_CR23","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson Education, London (2003)"},{"key":"4_CR24","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_CR25","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)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Spirtes, P., Glymour, C., Schemes, R.: Causation, Prediction, and Search, 2nd edn. The MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/1754.001.0001"},{"key":"4_CR27","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-D(2), 356\u2013367 (1999)"},{"key":"4_CR28","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_CR29","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_CR30","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_CR31","doi-asserted-by":"crossref","unstructured":"Van Beek, P., Hoffmann, H.-F.: Machine learning of Bayesian networks using constraint programming. In: Proceedings of the 21st Conference on Principles and Practice of Constraint Programming (2015)","DOI":"10.1007\/978-3-319-23219-5_31"},{"key":"4_CR32","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_CR33","doi-asserted-by":"crossref","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_CR34","unstructured":"Zhou, R., Hansen, E.A.: Sparse-memory graph search. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (2003)"},{"key":"4_CR35","unstructured":"Zhou, R., Hansen, E.A.: Structured duplicate detection in external-memory graph search. In: Proceedings of the 19th AAAI Conference on Artificial Intelligence (2004)"},{"key":"4_CR36","doi-asserted-by":"crossref","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":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-016-0004-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-016-0004-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-016-0004-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:59:33Z","timestamp":1658249973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-016-0004-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,21]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s00354-016-0004-9","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,21]]}}}