Parallell interacting MCMC for learning of topologies of graphical models

Data Mining and Knowledge Discovery

Volumn 17, Issue 3, 2008, Pages 431-456

  Corander, Jukka ^a   Ekdahl, Magnus ^b   Koski, Timo ^c  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

^b LINKÖPING UNIVERSITY   (Sweden)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Equivalence search; Learning graphical models; MCMC

Indexed keywords

EDUCATION; ELECTRIC NETWORK TOPOLOGY; GRAPHIC METHODS; LEARNING ALGORITHMS; LEARNING SYSTEMS; MARKOV PROCESSES; MODEL STRUCTURES; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; SENSOR NETWORKS; SET THEORY; SPEECH RECOGNITION; STOCHASTIC MODELS; STOCHASTIC PROGRAMMING; TOPOLOGY;

ADAPTIVE; CONSISTENT; DEGREE OF INTERESTS; DISCRETE VARIABLES; EFFICIENT SEARCHES; EQUIVALENCE SEARCH; FINITE SETS; GRAPHICAL MODELS; GREEDY METHODS; INTELLIGENT; LEARNING GRAPHICAL MODELS; MACHINE LEARNINGS; MARKOV CHAIN MONTE CARLO; MCMC; OPTIMAL MODEL STRUCTURES; OPTIMAL NETWORK TOPOLOGIES; SEARCH OPERATORS; STATISTICAL LEARNINGS; STOCHASTIC SEARCH METHODS; TRAPPING STATES;

MATHEMATICAL MODELS;

EID: 54249168561     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-008-0099-9     Document Type: Article

References (45)

1. Andersson SA, Madigan D, Perlman MD (1996) An alternative Markov property for chain graphs. In: Uncertainty in artificial intelligence: proceedings of the twelfth conference. Morgan Kaufmann, San Francisco, pp 40-48
2. SA Andersson D Madigan MD Perlman 1997 A characterization of Markov equivalence classes for acyclic digraphs Ann Statist 25 505 541
3. SA Andersson D Madigan MD Perlman 2001 Alternative Markov properties for chain graphs Scand J Stat 28 33 85
4. Chickering DM (1995) A transformational characterization of equivalent Bayesian network structures. In: Uncertainty in artificial intelligence: proceedings of the eleventh conference. Morgan Kaufmann, San Francisco, pp 87-98
5. DM Chickering 2002 Learning equivalence classes of Bayesian network structures J Mach Learn Res 2 445 498
6. DM Chickering 2002 Optimal structure identification with greedy search J Mach Learn Res 3 507 554
7. G Cooper E Hershkovitz 1992 A bayesian method for the induction of probabilistic networks from data Mach Learn 9 309 347
8. J Corander 2003 Bayesian graphical model determination using decision theory J Multivariate Anal 85 253 266
9. J Corander M Gyllenberg T Koski 2006 Bayesian model learning based on parallel mcmc strategy Stat Comput 16 355 362
10. Cowell RG, Dawid AP, Lauritzen SL and Spiegelhalter DJ (1999). Probabilistic networks and expert systems. Springer, New York
11. AP Dawid 1979 Conditional independence in statistical theory J Roy Stat Soc B 41 1 31
12. AP Dawid SL Lauritzen 1993 Hyper-Markov laws in the statistical analysis of decomposable graphical models Ann Statist 21 1272 1317
13. P Dellaportas J Forster 1999 Markov chain monte carlo model determination for hierarchical and graphical log-linear models Biometrika 86 615 633
14. Durrett R (1996). Probability: theory and examples. Duxbury Press, CA
15. M Frydenberg 1990 The chain graph Markov property Scand J Stat 17 333 353
16. M Frydenberg SL Lauritzen 1989 Decomposition of maximum likelihood in mixed graphical interaction models Biometrika 76 539 555
17. CJ Geyer EA Thompson 1995 Annealing Markov chain Monte Carlo with applications to ancestral inference J Am Stat Assoc 90 909 920
18. Gillispie SB, Perlman MD (2001) Enumerating Markov equivalence classes of acyclic digraph models. In: Uncertainty in artificial intelligence: proceedings of the seventeeth conference. Morgan Kaufmann, San Francisco, pp 171-177
19. P Giudici R Castelo 2003 Improving Markov chain Monte Carlo model search for data mining Mach Learn 50 127 158
20. P Giudici PJ Green 1999 Decomposable graphical Gaussian model determination Biometrika 86 785 801
21. Isaacson DL and Madsen RW (1976). Markov Chains: theory and applications. Wiley, New York
22. M Janzura J Nielsen 2006 A simulated annealing-based method for learning Bayesian networks from statistical data Int J Intell Syst 21 335 348
23. B Jones C Carvalho A Dobra 2005 Experiments in stochastic computation for high-dimensional graphical models Stat Sci 20 388 400
24. Jordan MI (1998). Learning in graphical models. MIT Press, Cumberland
25. M Koivisto K Sood 2004 Exact Bayesian structure discovery in Bayesian networks J Mach Learn Res 5 549 573
26. W Lam F Bacchus 1994 Learning Bayesian belief networks: An approach based on the MDL principle Comput Intell 10 269 293
27. D Madigan S Andersson M Perlman C Volinsky 1996 Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs Communtat Theor Meth 25 2493 2519
28. D Madigan A Raftery 1994 Model selection and accounting for model uncertainly in graphicalmodels using Occam's window J Am Stat Assoc 89 1535 1546
29. Peña JM (2007) Approximate counting of graphical models via MCMC. In: Proceedings of the 11th international conference on artificial intelligence, pp 352-359
30. I Poli A Roverato 1998 A genetic algorithm for graphical model selection J Italian Stat Soc 2 197 208
31. Riggelsen C (2005). MCMC learning of Bayesian network models by markov blanket decomposition. Springer, New York
32. Robert C and Casella G (2004). Monte Carlo statistical methods, 2nd edn. Springer, New York
33. A Roverato M Studený 2006 A graphical representation of equivalence classes of AMP chain graphs J Mach Learn Res 7 1045 1078
34. R Sanguesa U Cortes 1997 Learning causal networks from data: a survey and a new algorithm to learn possibilistic causal networks from data. AI Commun 4 1 31
35. Spirtes P, Glymour C and Scheines R (1993). Causation, prediction and search. Springer, New York
36. Studený M (1998) Bayesian networks from the point of view of chain graphs. Uncertainty in Artificial Intelligence: In: proceedings of the twelfth conference. Morgan Kaufmann, San Francisco, pp 496-503
37. R Sundberg 1975 Some results about decomposable (or markov-type) models for multidimensional contingency tables: distribution of marginals and partitioning of tests Scand J Stat 2 771 779
38. Suzuki J (1996) Learning Bayesian belief networks based on the minimum description length principle. In: International Conference Machine on Learning, Morgan Kaufmann, San Francisco, pp 462-470
39. J Suzuki 2006 On strong consistency of model selection in classification IEEE Trans Inform Theory 52 4767 4774
40. van Laarhoven PJM, Aarts EHJ (1987). Simulated annealing: theory and applications. Kluwer, Norwell
41. Verma E, Pearl J (1990) Equivalence and synthesis of causal models. In: Uncertainty in artificial intelligence: proceedings of the sixth conference. Elsevier, New York, pp 220-227
42. M Volf M Studený 1999 A graphical characterization of the largest chain graphs Int J Approx Reason 20 209 236
43. D Wedelin 1996 Efficient estimation and model selection in large graphical models Stat Comput 6 313 323
44. Whittaker J (1990). Graphical models in applied multivariate statistics. Wiley, Chichester
45. F Wong C Carter R Kohn 2003 Efficient estimation of covariance selection models Biometrika 90 809 830