{"type":"ScholarlyArticle","title":"Branch and Bound with Mini-Bucket Heuristics","authors":[{"name":"Kalev Kask","slug":"kalev-kask","given":"Kalev","family":"Kask","affiliation":"Department of Information and Computer Science University of California , Irvine , CA 92697-3425"},{"name":"Rina Dechter","slug":"rina-dechter","given":"Rina","family":"Dechter","affiliation":"Department of Information and Computer Science University of California , Irvine , CA 92697-3425"}],"abstract":"The paper describes a branch and bound scheme that uses heuristics generated mechanically by the mini-bucket approximation . This scheme is presented and evaluated for optimization tasks such as finding the Most Probable Explanation ( MP E ) in Bayesian networks. The mini-bucket scheme yields monotonic heuristics of varying strengths which cause different amounts of pruning, allowing a controlled tradeoff between preprocessing and search. The resulting Branch and Bound with Mini-Bucket heuristic (BBMB), is evaluated using random networks, probabilistic decoding and medical diagnosis networks. Results show that the BBMB scheme overcomes the memory explosion of bucket-elimination allowing a gradual tradeoff of space for time, and of time for accuracy.","doi":null,"url":"https://ijcai.org/proceedings/1999/62","pdf":"https://ijcai.org/proceedings/1999/0062.pdf","markdown":"https://ijcai.org/proceedings/1999/62.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/62","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":62,"pages":{"first":426,"last":434},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Dechter and Rish, 1997] R. Dechter and I. Rish. A scheme for approximat ing probabilistic inference. In Proceedings of Uncertainty in Artificial Int elligence (UA I9 7), pages 132-141 , 1997.","title":"A scheme for approximat ing probabilistic inference","authors":"R Dechter, I Rish","year":"1997","venue":"Proceedings of Uncertainty in Artificial Int elligence (UA I9 7)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Dechter , 1996] R. Dechter. Bucket elimina tion: A uni- fying fram ework for probabilistic inference algorithms. In Uncertainty in Artificial intelligence (U A 1-96), pages 211-219 , 1996.","title":"Bucket elimina tion: A unifying fram ework for probabilistic inference algorithms","authors":"R Dechter","year":"1996","venue":"Uncertainty in Artificial intelligence (U A 1-96)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Kask and Dechter, 1999a] K. Kask and R . Dechter. On the power of mini-bucket heuristics for improved search. UCI Technical report, 1999.","title":"On the power of mini-bucket heuristics for improved search","authors":"Dechter Kask, K Kask, R Dechter","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Kask and Dechter, 1999b] K. Kask and R . Dechter. Stochastic local search for bayesian networks. In Workshop on AI and Statistics (AISTAT99) , 1999.","title":"Stochastic local search for bayesian networks","authors":"Dechter ; Kask, ] K Kask, R Dechter","year":"1999","venue":"Workshop on AI and Statistics (AISTAT99)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Pearl , 1988] J. Pearl. Probabilistic Reasoning in intel- ligent Systems. Morga n Ka ufm ann , 1988.","title":"Probabilistic Reasoning in intelligent Systems","authors":"J Pearl","year":"1988","venue":"Morga n Ka ufm ann","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Peng and Regg ia, 1986] Y. Peng and J .A. Reggia. Plausability of diagnostic hypothesis. In Natio nal Conference on Artificial Intelligence (AAAI86) , pages 140-145, 1986.","title":"Plausability of diagnostic hypothesis","authors":"Y Peng, J A Reggia","year":"1986","venue":"Natio nal Conference on Artificial Intelligence (AAAI86)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Peng and Reggia , 1989] Y. Peng and J .A . Reggia. A connectionist model for di agnostic problem solving. IEEE Transa ctions on Systems, Man and Cybernet- ics, 1989.","title":"A connectionist model for di agnostic problem solving","authors":"Y Peng, J A Reggia","year":"1989","venue":"IEEE Transa ctions on Systems, Man and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Pradhan et al. , 1994] M. Pradhan , G. Provan, B. Mid- dleton , and M. Henrion. Knowledge engineering for large belief networks . In Proc. Tenth Conf. on Uncer- tainty in Artificial i ntelligence, 1994.","title":"Knowledge engineering for large belief networks","authors":"M Pradhan, G Provan, B Middleton, M Henrion","year":"1994","venue":"Proc. Tenth Conf. on Uncertainty in Artificial i ntelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Rish et al. , 1998] I.","title":null,"authors":"Rish","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Rish , K. Kask, and R . Dechter. Ap- proximation a lgorithms for probabilistic decoding. In Uncertainty in Artificial Intelligence (UA 1-98 ) , 1998.","title":"Approximation a lgorithms for probabilistic decoding","authors":"K Rish, R Kask, Dechter","year":"1998","venue":"Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Santos, 1991] E. Santos. On the generat ion of alter- native explanations with implications for belief revi- sion. In Uncertainty in Artificial Intelligence (UAI- 91), pages 339-347, 199 1.","title":"On the generat ion of alternative explanations with implications for belief revision","authors":"E Santos","year":null,"venue":"Uncertainty in Artificial Intelligence (UAI-91)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Shimony and Charniak, 1991] S.E. Shimony and E. Charniak. A new algorithm for finding map assign- ments to belief networks. In P. Bonissone, M. Hen- rion, L. I< anal, and J. Lem m er E ds. Uncertainty in Artificial Intelligence, volume 6, pages 185-193 , 1991.","title":"A new algorithm for finding map assignments to belief networks","authors":"S E Shimony, E Charniak","year":"1991","venue":"Uncertainty in Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}