Characterization of inclusion neighbourhood in terms of the essential graph

International Journal of Approximate Reasoning

Volumn 38, Issue 3, 2005, Pages 283-309

  Studený, Milan ^a  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

Essential graph; Inclusion neighbourhood; Learning Bayesian networks

Indexed keywords

COMPUTATIONAL METHODS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

ESSENTIAL GRAPHS; INCLUSION NEIGHBOURHOOD; LEARNING BAYESIAN NETWORKS;

GRAPH THEORY;

EID: 10844294897     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2004.05.007     Document Type: Conference Paper

References (21)

1. S.A. Andersson, D. Madigan, M.D. Perlman, A characterization of Markov equivalence classes for acyclic digraphs, Annals of Statistics 25 (1997) 505-541.
2. V. Auvray, L. Wehenkel, On the construction of the inclusion boundary neighbourhood for Markov equivalence classes of Bayesian network structures, in: Darwiche, N. Friedman (Eds.) Uncertainty in Artificial Intelligence 18, A, Morgan Kaufmann, 2002, pp. 26-35.
3. R.R. Bouckaert, Bayesian belief networks: from construction to inference, PhD thesis, University of Utrecht, 1995.
4. R. Castelo, The discrete acyclic digraph Markov model in data mining, PhD thesis, University of Utrecht, 2002.
5. D.M. Chickering, Optimal structure identification with greedy search, Journal of Machine Learning Research 3 (2002) 507-554.
6. M. Frydenberg, The chain graph Markov property, Scandinavian Journal of Statistics 17 (1990) 333-353.
7. F. V. Jensen, Bayesian Networks and Decision Graphs, Springer-Verlag, New York, 2001.
8. T. Kočka, R. Castello, Improved learning of Bayesian networks, in: J. Breese, D. Koller (Eds.), Uncertainty in Artificial Intelligence 17, Morgan Kaufmann, 2001, pp. 269-276.
9. S.L. Lauritzen, Graphical Models, Clarendon Press, Oxford, 1996.
10. C. Meek, Causal inference and causal explanation with background knowledge, in: P. Besnard, S. Hanks (Eds.), Uncertainty in Artificial Intelligence 11, Morgan Kaufmann, 1995, pp. 403-410.
11. C. Meek, Graphical models, selecting causal and statistical models, PhD thesis, Carnegie Mellon University, 1997.
12. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, 1988.
13. A. Roverato, A unified approach to the characterisation of equivalence classes of DAGs, chain graphs with no flags and chain graphs, accepted in Scandinavian Journal of Statistics.
14. P. Spirtes, C. Glymour, R. Scheines, Causation, Prediction, and Search, Springer-Verlag, New York, 1993.
15. M. Studený, A recovery algorithm for chain graphs, International Journal of Approximate Reasoning 17 (1997) 265-293.
16. M. Studený, R.R. Bouckaert, On chain graph models for description of conditional independence structures, Annals of Statistics 26 (1998) 1434-1495.
17. M. Studený, Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours, in: D.H. Nielsen, N.L. Zhang (Eds.), Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in AI 2711, Springer-Verlag, 2003, pp. 161-172.
18. M. Studený, Characterization of inclusion neighbourhood in terms of the essential graph: lower neighbours, in: J. Vejnarová (Ed.), Proceedings of WUPES 2003, School of Economics Prague, 2003, pp. 243-264.
19. M. Studený, Characterization of essential graphs by means of an operation of legal merging of components, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 12 (2004) 43-62.
20. M. Studený, Probabilistic Conditional Independence Structures, a Research Monograph, Springer-Verlag, 2004.
21. T. Verma, J. Pearl, Equivalence and synthesis of causal models, in: P.P. Bonissone, M. Henrion, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence 6, Elsevier, 1991, pp. 220-227.