Characterization of inclusion neighbourhood in terms of the essential graph: Upper neighbours

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2711, Issue , 2003, Pages 161-172

  Studený, Milan ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; FUNCTIONS; LEARNING SYSTEMS; LEAST SQUARES APPROXIMATIONS; PROBLEM SOLVING; SET THEORY; BAYESIAN NETWORKS; C (PROGRAMMING LANGUAGE); CHARACTERIZATION; COMPLEX NETWORKS;

ESSENTIAL GRAPHS; LEARNING PROCEDURE; REAL NUMBER; SUBSETS; EQUIVALENCE CLASS OF BAYESIAN NETWORKS; ESSENTIAL GRAPH; INCLUSION NEIGHBOURHOOD; INTERNAL STRUCTURE; MAXIMAL SETS;

GRAPH THEORY; EQUIVALENCE CLASSES;

EID: 8344269407     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45062-7_13     Document Type: Conference Paper

References (16)

1. Andersson, S.A., Madigan, D. and Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics 25 (1997) 505-541.
2. Auvray, V. and Wehenkel, L.: On the construction of the inclusion boundary neighbourhood for Markov equivalence clases of Bayesian network structures. In: Darwiche, A. and Friedman, N. (eds.): Uncertainty in Artificial Intelligence 18. Morgan Kaufmann, San Francisco (2002) 26-35.
3. Bouckaert, R.R.: Bayesian belief networks: from construction to inference. PhD thesis, University of Utrecht (1995).
4. Castelo, R.: The discrete acyclic digraph Markov model in data mining. PhD thesis, University of Utrecht (2002).
5. Chickering, D.M.: Optimal structure identification with greedy search. To appear in Journal of Machine Learning Research (2003).
6. Frydenberg, M.: The chain graph Markov property. Scandinavian Journal of Statistics 17 (1990) 333-353.
7. Kočka, T. and Castello, R.: Improved learning of Bayesian networks. In: Breese, J. and Koller, D. (eds.): Uncertainty in Artificial Intelligence 17. Morgan Kaufmann, San Francisco (2001) 269-276.
8. Lauritzen, S.L.: Graphical Models. Clarendon Press, Oxford (1996).
9. Meek, C.: Graphical models, selectin causal and statistical models. PhD thesis, Carnegie Mellon University (1997).
10. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988).
11. Rovenato, A.: A unified approach to the characterisation of equivalence classes of DAGs, chain graphs with no flags and chain graphs. Technical report, Dipartimento di Scienze Sociali Cognitive e Quantitative, University of Modena and Reggio Emilia (2003), submitted to Annals of Statistics.
12. Studený, M.: A recovery algorithm for chain graphs. International Journal of Approximate Reasoning 17 (1997) 265-293.
13. Studený, M.: On probabilistic conditional independence structures. A research monograph, Institute of Information Theory and Automation, Prague, Czech Republic (2003), offerred to Springer Verlag.
14. Studený, M.: Characterization of essential graphs by means of an operation of legal merging of components. Submitted to International Journal of Uncertainty, Fuzziness and Knowledge-based Systems.
15. Studený, M.: Characterization of inclusion neighbourhood in terms of the essential graph: lower neighbours. In preparation, to be submitted to Proceedings of WUPES 2003.
16. Verma, T. and Pearl, J.: Equivalence and synthesis of causal models. In: Bonissone, P.P., Henrion, M., Kanal L.N. and Lemmer, J.F. (eds.): Uncertainty in Artificial Intelligence 6. Elsevier, New York (1991) 220-227.