A novel scalable and correct Markov boundary learning algorithm under faithfulness condition

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

Volumn , Issue , 2008, Pages 81-88

  De Morais, Sergio Rodrigues ^a   Aussem, Alex ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT-BASED; DISCOVERY ALGORITHM; FUNCTIONAL DEPENDENCY; MARKOV BOUNDARY; SYNTHETIC DATABASE;

GRAPHIC METHODS; SOFTWARE ENGINEERING;

LEARNING ALGORITHMS;

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

References (16)

1. A. Aussem, S. Rodrigues de Morais, and M. Cor-bex. 2007. Nasopharyngeal carcinoma data analysis with a novel bayesian network skeleton learning. In 11th Conference on Artificial Intelligence in Medicine AIME 07, pages 326-330.
2. Denver Dash and Marek J. Druzdzel. 2003. Robust independence testing for constraint-based learning of causal structure. In UAI, pages 167-174.
3. Isabelle Guyon and Andŕe Elisseeff. 2003. An introduction to variable and feature selection. Journal of Machine Learning Research, 3:1157-1182.
4. Wei Luo. 2006. Learning bayesian networks in semi-deterministic systems. In Canadian Conference on AI, pages 230-241.
5. R. E. Neapolitan. 2004. Learning Bayesian Networks. Prentice Hall.
6. R. Nilsson, J.M. Peña, J. Bjrkegren, and J. Tegnr. 2007. Consistent feature selection for pattern recognition in polynomial time. Journal of Machine Learning Research, 8:589-612.
7. J.M. Peña, J. Bjrkegren, and J. Tegńer. 2005. Scalable, efficient and correct learning of markov boundaries under the faithfulness assumption. In 8th European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty (ECSQARU 2005), volume 21, pages 136-147. Lecture Notes in Artificial Intelligence 3571.
8. J.M. Peña, R. Nilsson, J. Bjrkegren, and J. Tegnr. 2007. Towards scalable and data efficient learning of markov boundaries. International Journal of Approximate Reasoning, 45(2):211-232.
9. S. Rodrigues de Morais and A. Aussem. 2008. A novel scalable and data efficient feature subset selection algorithm. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD, Antwerp, Belgium.
10. S. Rodrigues de Morais, A. Aussem, and M. Cor-bex. 2008. Handling almost-deterministic relationships in constraint-based bayesian network discovery : Application to cancer risk factor identification. In 16th European Symposium on Artificial Neural Networks ESANN'08, pages 101-106.
11. Peter Spirtes, Clark Glymour, and Richard Scheines. 2000. Causation, Prediction, and Search. The MIT Press, 2 edition.
12. Ioannis Tsamardinos, Constantin F. Aliferis, and Alexander R. Statnikov. 2003. Algorithms for large scale markov blanket discovery. In FLAIRS Conference, pages 376-381.
13. Ioannis Tsamardinos, Laura E. Brown, and Constantin F. Aliferis. 2006. The max-min hill-climbing bayesian network structure learning algorithm. Machine Learning, 65(1):31-78.
14. Sandeep Yaramakala and Dimitris Margaritis. 2005. Speculative markov blanket discovery for optimal feature selection. In ICDM, pages 809-812.
15. Sandeep Yaramakala. 2004. Fast markov blanket discovery. In MS-Thesis, Iowa State University.
16. Yusuf Kenan Yilmaz, Ethem Alpaydin, H. Levent Akin, and Taner Bilgi̧c. 2002. Handling of deterministic relationships in constraint-based causal discovery. In Probabilistic Graphical Models.