A score based ranking of the edges for the PC algorithm

Proceedings of the 4th European Workshop on Probabilistic Graphical Models, PGM 2008

Volumn , Issue , 2008, Pages 41-48

  Cano, A ^a   Gomez Olmedo M ^a   Moral, S ^a  

^a UNIVERSITY OF GRANADA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN; CONDITIONAL INDEPENDENCE TESTS; CONDITIONAL SETS; CUT SETS; INDEPENDENCE TESTS;

GRAPHIC METHODS; SOFTWARE ENGINEERING;

LEARNING ALGORITHMS;

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

References (17)

1. J. Abelĺan, M. Ǵomez-Olmedo, and S. Moral. 2006. Some variations on the PC algorithm. In Proceedings of the Third European Workshop on Probabilistic Graphical Models (PGM' 06), pages 1-8.
2. S. Acid and L.M. de Campos. 1996. Finding minimum d-separating sets in belief networks. In Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence (UAI-96), pages 3-10, Portland, Oregon.
3. I.A. Beinlich, H.J. Suermondt, R.M. Chavez, and G.F. Cooper. 1989. The Alarm monitoring system: A case study with two probabilistic inference techniques for belief networks. In Proceedings of the Second European Conference on Artificial Intelligence in Medicine, pages 247-256. SpringerVerlag.
4. J. Cohen. 1988. Statistical power analysis for the behavioral sciences (2nd edition). Erlbaum, Hills-dale, NJ.
5. Elvira Consortium. 2002. Elvira: An environment for probabilistic graphical models. In J.A. Ǵamez and A. Salmeŕon, editors, Proceedings of the 1st European Workshop on Probabilistic Graphical Models, pages 222-230.
6. G.F. Cooper and E.A. Herskovits. 1992. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-347.
7. G.F. Cooper. 1997. A simple constraint-based algorithm for efficiently mining observational databases for causal relationships. Data Mining and Knowledge Discovery, 1:203-224.
8. D. Dash and M.J. Druzdzel. 1999. A hybrid anytime algorithm for the construction of causal models from sparse data. In Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), pages 142-149. Morgan Kaufmann.
9. D. Heckerman, C. Meek, and G. Cooper. 1999. A Bayesian approach to causal discovery. In C. Gly-mour and G.F. Cooper, editors, Computation, Causation, and Discovery, pages 141-165. AAAI Press.
10. D. Heckerman. 1995. A tutorial on learning with Bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research.
11. M. Henrion. 1988. Propagating uncertainty by logic sampling in Bayes networks. In J. Lemmer and L.N. Kanal, editors, Uncertainty in Artificial Intelligence, 2, pages 149-164. Horth-Holland, Amsterdam.
12. S. Moral. 2004. An empirical comparison of score measures for independence. In Proceedings of the Tenth International Conference IPMU 2004, Vol. 2, pages 1307-1314.
13. J. Pearl. 1988. Probabilistic Reasoning with Intelligent Systems. Morgan & Kaufman, San Mateo.
14. P. Spirtes, C. Glymour, and R. Scheines. 1993. Causation, Prediction and Search. Springer Verlag, Berlin.
15. H. Steck and V. Tresp. 1999. Bayesian belief networks for data mining. In Proceedings of the 2nd Workshop on Data Mining und Data Warehousing als Grundlage moderner entscheidungsunter-stuetzender Systeme, pages 145-154.
16. I. Tsamardinos, L. E. Brown, and C. F. Alif-eris. 2006. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning, 65:31-78.
17. S. van Dijk, L.C. can der Gaag, and D. Thierens. 2003. A skeleton-based approach to learning Bayesian networks from data. In Proceedings of the Seventh Conference on Principles and Practice of Knowledge Discovery in Databases, pages 132-143. Springer Verlag.