Characteristic imset: A simple algebraic representative of a Bayesian network structure

Proceedings of the 5th European Workshop on Probabilistic Graphical Models, PGM 2010

Volumn , Issue , 2010, Pages 257-264

  Studený, Milan ^a   Hemmecke, Raymond ^b   Lindner, Silvia ^c  

^a Institute of Information Theory and Automation of ASCR   (Czech Republic)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINE FUNCTION; AFFINE TRANSFORMATIONS; BAYESIAN NETWORK STRUCTURE; CHAIN GRAPH; DECOMPOSABLE MODELS; ESSENTIAL GRAPH; GEOMETRIC APPROACHES; GRAPHICAL DESCRIPTION; QUALITY CRITERIA; STANDARD IMSET;

BAYESIAN NETWORKS;

ALGEBRA;

EID: 79954420130     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Steen A. Andersson, David Madigan and Michael D. Perlman. 1997. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics, 25(2):505-541.
2. Remco R. Bouckaert. 1995. Bayesian belief networks: from construction to evidence. PhD thesis, University of Utrecht.
3. David M. Chickering. 2002. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:507-554.
4. C. K. Chow, C. N. Liu. 1968. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3):462-467.
5. Raymond Hemmecke, Silvia Lindner, Milan Studeńy, and Jǐŕi Vomlel. 2010. Characteristic imsets for learning Bayesian network structures. In preparation.
6. Steffen L. Lauritzen. 1996. Graphical Models, Clarendon Press.
7. Chris Meek. 1995. Causal inference and causal explanation with background knowledge. In 11th Conference on Uncertainty in Artificial Intelligence, pages 403-410.
8. Richard E. Neapolitan. 2004. Learning Bayesian Networks, Pearson Prentice Hall.
9. Alexander Schrijver. 2003. Combinatorial Optimization - Polyhedra and Efficiency, volume B, Springer Verlag.
10. Gideon E. Schwarz. 1978. Estimation of the dimension of a model. Annals of Statistics, 6:461-464.
11. Milan Studeńy. 2004. Characterization of essential graphs by means to the operation of legal merging of components. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 12:43-62.
12. Milan Studeńy. 2005. Probabilistic Conditional Independence Structures, Springer Verlag.
13. Milan Studeńy and Jǐŕi Vomlel. 2009. A reconstruction algorithm for the essential graph. International Journal of Approximate Reasoning, 50:385- 413.
14. Milan Studený, Alberto Roverato and Šárka Štěpánová. 2009. Two operations of merging and splitting components in a chain graph. Kybernetika, 45(2):208-248.
15. Milan Studeńy, Jǐŕi Vomlel and Raymond Hemmecke. 2010. A geometric view on learning Bayesian network structures. International Journal of Approximate Reasoning, 51(5):578-586.
16. Thomas Verma and Judea Pearl. 1991. Equivalence and synthesis of causal models. In 6th Conference on Uncertainty in Artificial Intelligence, pages 220-227.