
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ole J. Mengshoel, David C. Wilkins, Dan Roth, "Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 2, pp. 235247, February, 2011.  
BibTex  x  
@article{ 10.1109/TKDE.2010.98, author = {Ole J. Mengshoel and David C. Wilkins and Dan Roth}, title = {Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, number = {2}, issn = {10414347}, year = {2011}, pages = {235247}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.98}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks IS  2 SN  10414347 SP235 EP247 EPD  235247 A1  Ole J. Mengshoel, A1  David C. Wilkins, A1  Dan Roth, PY  2011 KW  Stochastic local search KW  Bayesian networks KW  initialization KW  restart KW  finite mixture models. VL  23 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
[2] F.R. Kschischang, B.J. Frey, and H.A. Loeliger, "Factor Graphs and the SumProduct Algorithm," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 498519, Feb. 2001.
[3] M. Wainwright, T. Jaakkola, and A. Willsky, "MAP Estimation via Agreement on (Hyper)Trees: MessagePassing and Linear Programming Approaches," IEEE Trans. Information Theory, vol. 51, no. 11, pp. 36973717, Nov. 2002.
[4] M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky, "TreeBased Reparameterization Framework for Analysis of SumProduct and Related Algorithms," IEEE Trans. Information Theory, vol. 49, no. 5, pp. 11201146, May 2003.
[5] A. Darwiche, "A Differential Approach to Inference in Bayesian Networks," J. ACM, vol. 50, no. 3, pp. 280305, 2003.
[6] S. Lauritzen and D.J. Spiegelhalter, "Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems (with Discussion)," J. Royal Statistical Soc. Series B, vol. 50, no. 2, pp. 157224, 1988.
[7] S.K. Andersen, K.G. Olesen, F.V. Jensen, and F. Jensen, "HUGIN— A Shell for Building Bayesian Belief Universes for Expert Systems," Proc. 11th Int'l Joint Conf. Artificial Intelligence, vol. 2, pp. 10801085, Aug. 1989.
[8] C. Huang and A. Darwiche, "Inference in Belief Networks: A Procedural Guide," Int'l J. Approximate Reasoning, vol. 15, pp. 225263, 1996.
[9] B. Selman, H. Levesque, and D. Mitchell, "A New Method for Solving Hard Satisfiability Problems," Proc. 10th Nat'l Conf. Artificial Intelligence (AAAI '92), pp. 440446, 1992.
[10] B. Selman, H.A. Kautz, and B. Cohen, "Noise Strategies for Improving Local Search," Proc. 12th Nat'l Conf. Artificial Intelligence (AAAI '94), pp. 337343, 1994.
[11] P.W. Gu, J. Purdom, J. Franco, and B.W. Wah, "Algorithms for the Satisfiability SAT Problem: A Survey," Satisfiability Problem: Theory and Applications, pp. 19152. Am. Math. Soc., 1997.
[12] H.H. Hoos and T. Stützle, Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, 2005.
[13] K. Kask and R. Dechter, "Stochastic Local Search for Bayesian Networks," Proc. Seventh Int'l Workshop Artificial Intelligence and Statistics, Jan. 1999.
[14] O.J. Mengshoel, "Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction," PhD dissertation, Dept. of Computer Science, Univ. of Illinois at UrbanaChampaign, Apr. 1999.
[15] O.J. Mengshoel, D. Roth, and D.C. Wilkins, "Stochastic Greedy Search: Computing the Most Probable Explanation in Bayesian Networks," Technical Report UIUCDCSR20002150, Dept. of Computer Science, Univ. of Illinois at UrbanaChampaign, Feb. 2000.
[16] F. Hutter, H.H. Hoos, and T. Stützle, "Efficient Stochastic Local Search for MPE Solving," Proc. 19th Int'l Joint Conf. Artificial Intelligence (IJCAI '05), pp. 169174, 2005.
[17] O.J. Mengshoel, "Understanding the Role of Noise in Stochastic Local Search: Analysis and Experiments," Artificial Intelligence, vol. 172, nos. 89, pp. 955990, 2008.
[18] O.J. Mengshoel, D. Roth, and D.C. Wilkins, "Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks," J. Automated Reasoning, published online 14 Apr. 2010.
[19] J.D. Park and A. Darwiche, "Complexity Results and Approximation Strategies for MAP Explanations," J. Artificial Intelligence Research, vol. 21, pp. 101133, 2004.
[20] B. Selman and H. Kautz, "DomainIndependent Extensions to GSAT: Solving Large Structured Satisfiability Problems," Proc. Int'l Joint Conf. Artificial Intelligence (IJCAI '93), pp. 290295, 1993.
[21] R. Lin, A. Galper, and R. Shachter, "Abductive Inference Using Probabilistic Networks: Randomized Search Techniques," Technical Report KSL9073, Knowledge Systems Laboratory, Nov. 1990.
[22] L.R. Rabiner, "A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition," Proc. IEEE, vol. 77, no. 2, pp. 257286, Feb. 1989.
[23] H.H. Hoos and T. Stützle, "Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT," Artificial Intelligence, vol. 112, nos. 12, pp. 213232, 1999.
[24] H.H. Hoos and T. Stützle, "Local Search Algorithms for SAT: An Empirical Evaluation," J. Automated Reasoning, vol. 24, no. 4, pp. 421481, citeseer.ist.psu.eduhoos99local.html, 2000.
[25] D. Mitchell, B. Selman, and H.J. Levesque, "Hard and Easy Distributions of SAT Problems," Proc. 10th Nat'l Conf. Artificial Intelligence (AAAI '92), pp. 459465, 1992.
[26] H.H. Hoos, "A MixtureModel for the Behaviour of SLS Algorithms for SAT," Proc. 18th Nat'l Conf. Artificial Intelligence (AAAI '02), pp. 661667, 2002.
[27] I.P. Gent and T. Walsh, "Easy Problems are Sometimes Hard," Artificial Intelligence, vol. 70, nos. 12, pp. 335345, 1994.
[28] A.J. Parkes and J.P. Walser, "Tuning Local Search for Satisfiability Testing," Proc. 13th Nat'l Conf. Artificial Intelligence (AAAI '96), pp. 356362, citeseer.ist.psu.eduparkes96tuning.html, 1996.
[29] C.P. Gomes, B. Selman, and H. Kautz, "Boosting Combinatorial Search through Randomization," Proc. 15th Nat'l Conf. Artificial Intelligence (AAAI '98), pp. 431437, 1998.
[30] E. Horvitz, Y. Ruan, C. Gomes, H. Kautz, B. Selman, and D. Chickering, "A Bayesian Approach to Tackling Hard Computational Problems," Proc. 17th Ann. Conf. Uncertainty in Artificial Intelligence (UAI '01), pp. 235244, 2001.
[31] Y. Ruan, E. Horvitz, and H. Kautz, "Restart Policies with Dependence among Runs: A Dynamic Programming Approach," Proc. Eighth Int'l Conf. Principles and Practice of Constraint Programming, pp. 573586, 2002.
[32] Y. Ruan, E. Horvitz, and H. Kautz, "HardnessAware Restart Policies," Proc. 18th Int'l Joint Conf. Artificial Intelligence (IJCAI '03) Workshop Stochastic Search Algorithms, 2003.
[33] A.P. Dawid, "Applications of a General Propagation Algorithm for Probabilistic Expert Systems," Statistics and Computing, vol. 2, pp. 2536, 1992.
[34] E. Shimony, "Finding MAPs for Belief Networks is NPHard," Artificial Intelligence, vol. 68, pp. 399410, 1994.
[35] A.M. Abdelbar and S.M. Hedetnieme, "Approximating MAPs for Belief Networks is NPHard and Other Theorems," Artificial Intelligence, vol. 102, pp. 2138, 1998.
[36] A. Viterbi, "Error Bounds for Convolutional Codes and An Asymptotically Optimal Decoding Algorithm," IEEE Trans. Information Theory, vol. 13, no. 2, pp. 260269, Apr. 1967.
[37] M. Henrion, "Propagating Uncertainty in Bayesian Networks by Probabilistic Logic Sampling," Uncertainty in Artificial Intelligence, vol. 2, pp. 149163, Elsevier, 1988.
[38] R. Dechter and I. Rish, "MiniBuckets: A General Scheme for Bounded Inference," J. ACM, vol. 50, no. 2, pp. 107153, 2003.
[39] R. Dechter, "Bucket Elimination: A Unifying Framework for Reasoning," Artificial Intelligence, vol. 113, nos. 12, pp. 4185, citeseer.nj.nec.com/articledechter99bucket.html , 1999.
[40] D. Schuurmans and F. Southey, "Local Search Characteristics of Incomplete SAT Procedures," Artificial Intelligence, vol. 132, no. 2, pp. 121150, citeseer.ist.psu.edu/articleschuurmans00local.html , 2001.
[41] J. Hooker, "Testing Heuristics: We have It All Wrong," J. Heuristics, vol. 1, pp. 3342, 1996.
[42] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[43] B.A. Huberman, R.M. Lukose, and T. Hogg, "An Economics Approach to Hard Computational Problems," Science, vol. 275, no. 3, pp. 5154, 1997.
[44] P. Jones, C. Hayes, D. Wilkins, R. Bargar, J. Sniezek, P. Asaro, O.J. Mengshoel, D. Kessler, M. Lucenti, I. Choi, N. Tu, and J. Schlabach, "CoRAVEN: Modeling and Design of a Multimedia Intelligent Infrastructure for Collaborative Intelligence Analysis," Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics, pp. 914919, Oct. 1998.
[45] I.H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques, second ed., Morgan Kaufmann, 2005.
[46] H.L. Bodlaender, "A Tourist Guide through Treewidth," Acta Cybernetica, vol. 11, pp. 121, citeseer.nj.nec.combodlaender93 tourist.html , 1993.