Structural learning of Bayesian networks via constrained Hill Climbing algorithms: Adjusting trade-off between efficiency and accuracy

International Journal of Intelligent Systems

Volumn 30, Issue 3, 2015, Pages 292-325

  Arias, Jacinto ^a   Gámez, José A ^a   Puerta, José M ^a  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; COMPUTATIONAL COMPLEXITY; ECONOMIC AND SOCIAL EFFECTS; EFFICIENCY;

EXPERIMENTAL EVALUATION; HIGH-DIMENSIONAL; HILL CLIMBING ALGORITHMS; LEARNING BAYESIAN NETWORKS; LEARNING MODELS; LOCAL SEARCH ALGORITHM; ORIGINAL ALGORITHMS; STRUCTURAL LEARNING;

LEARNING ALGORITHMS;

EID: 84921028207     PISSN: 08848173     EISSN: 1098111X     Source Type: Journal    
DOI: 10.1002/int.21701     Document Type: Review

References (31)

1. Jensen FV, Nielsen TD. Bayesian networks and decision graphs, 2nd ed. Springer; 2007.
2. Pearl J. Probabilistic reasoning in intelligent systems: networks of plausible inference. San Francisco, CA: Morgan Kaufmann; 1988.
3. Heckerman D, Geiger D, Chickering DM. Learning Bayesian networks: the combination of knowledge and statistical data. Mach Learn 1995;20(3):197-243.
4. Neapolitan RE. Learning Bayesian networks. Upper Saddle River, NJ: Pearson Prentice Hall; 2004.
5. Chickering DM. Learning Bayesian networks is NP-complete. Learning from data. Springer; 1996. pp 121-130.
6. Tsamardinos I, Brown LE, Aliferis CF. The max-min hill-climbing Bayesian network structure learning algorithm. Mach Learn 2006;65(1):31-78.
7. Gámez JA, Mateo JL, Puerta JM. Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood. Data Min Knowl Discov 2011;22(1-2):106-148.
8. Gámez JA, Mateo JL, Puerta JM. One iteration CHC algorithm for learning Bayesian networks: an effective and efficient algorithm for high dimensional problems. Prog. Artif Intell 2012;1(4):329-346.
9. Chickering DM. Optimal structure identification with greedy search. J Mach Learn Res 2002;3:507-554.
10. Glover F. Tabu search: part I. ORSA J Comput 1989;1(3):190-206.
11. 3n) - tin2007-67418-c03-01, 2010.
12. Alonso-Barba JI, delaOssa L, Gámez JA, Puerta JM. Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes. Int J Approx Reason 2012;54:429-451.
13. Demšar J. Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 2006;7:1-30.
14. Garcia S, Herrera F. An extension on statistical comparisons of classifiers over multiple data sets for all pairwise comparisons. J Mach Learn Res 2008;9:2677-2694.
15. Friedman M. A comparison of alternative tests of significance for the problem of m rankings. Ann Math Statist 1940;11(1):86-92.
16. Holm S. A simple sequentially rejective multiple test procedure. Scand J Statist 1979;65-70.
17. Beinlich IA, Suermondt HJ, Chavez RM, Cooper GF. The ALARM monitoring system: a case study with two probabilistic inference techniques for belief networks. Springer; 1989.
18. Conati C, Gertner AS, VanLehn K, Druzdzel MJ. On-line student modeling for coached problem solving using Bayesian networks. Courses and lectures. International Centre For Mechanical Sciences; 1997. pp 231-242.
19. Kristensen K, Rasmussen IA. The use of a Bayesian network in the design of a decision support system for growing malting barley without use of pesticides. Comput Electron Agric 2002;33(3):197-217.
20. Cowell RG, Dawid AP, Lauritzen SL, Spiegelhalter DJ. Probabilistic networks and expert systems. Springer; 1999.
21. Andreassen S, Hovorka R, Benn J, Olesen KG, Carson ER. A model-based approach to insulin adjustment. Springer; 1991.
22. Jensen AL, Jensen FV. Midas-an influence diagram for management of mildew in winter wheat. Proceedings of the 12th International Conference on Uncertainty in Artificial Intelligence., Morgan Kaufmann; 1996. pp 349-356.
23. Onisko A, Druzdzel MJ, Wasyluk H. A probabilistic causal model for diagnosis of liver disorders. Proceedings of the Workshop held in Malbork, Poland. Citeseer, 1998.
24. Binder J, Koller D, Russell S, Kanazawa K. Adaptive probabilistic networks with hidden variables. Mach Learn 1997;29(2-3):213-244.
25. Jensen CS. Blocking Gibbs sampling for inference in large and complex Bayesian networks with applications in genetics, PhD Thesis, Aalborg University, Aalborg, Denmark, 1997.
26. Andreassen S, Jensen FV, ersen SK, Falck B, Kjærulff U, Woldbye M, Sørensen AR, Rosenfalck A, Jensen F. Munin - an expert emg assistant. In: Desmedt JE, editor. Computer-aided electromyography and expert systems. Amsterdam, the Netherlands: Elsevier; 1989. pp 255-277.
27. Heckerman DE, Nathwani BN. Toward normative expert systems: part I. The pathfinder project. Methods Inf Med 1992;31(2):90-105.
28. Jensen FV, Kjærulff U, Olesen KG, Pedersen J. Et forprojekt til et ekspertsystem for drift af spildevandsrensning (an expert system for control of waste water treatment-a pilot project). Technical Report, Judex Datasystemer A/S, Aalborg, Denmark, 1989.
29. Jensen CS, Kong A. Blocking gibbs sampling for linkage analysis in large pedigrees with many loops. Am J Hum Genet 1999;65(3):885-901.
30. Heckerman D, Breese JS, Rommelse K. Decision-theoretic troubleshooting. Commun ACM 1995;38(3):49-57.
31. Arias J, Gámez JA, Puerta JM. Learning more accurate Bayesian networks in the CHC approach by adjusting the trade-off between efficiency and accuracy. In: Bielza et al., editors. Advances in artificial intelligence. Springer; 2013. pp 310-320.