Towards scalable and data efficient learning of Markov boundaries

International Journal of Approximate Reasoning

Volumn 45, Issue 2, 2007, Pages 211-232

  Peña, Jose M ^a   Nilsson, Roland ^a   Björkegren, Johan ^b   Tegnér, Jesper ^a,b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b KAROLINSKA INSTITUTE   (Sweden)

Author keywords

Bayesian networks; Classification; Feature subset selection

Indexed keywords

ALGORITHMS; BAYESIAN NETWORKS; CLASSIFICATION (OF INFORMATION); DATA TRANSFER; DATABASE SYSTEMS; FEATURE EXTRACTION; GENE EXPRESSION;

DATA EFFICIENT LEARNING; PROBABILISTIC CLASSIFICATION; REAL DATABASES;

MARKOV PROCESSES;

EID: 34249931694     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2006.06.008     Document Type: Article

References (23)

1. C.F. Aliferis, I. Tsamardinos, A. Statnikov, HITON, A novel Markov blanket algorithm for optimal variable selection, in: Proceedings of the 2003 American Medical Informatics Association Annual Symposium, 2003, pp. 21-25.
2. J. Cheng, C. Hatzis, H. Hayashi, M.A. Krogel, S. Morishita, D. Page, J. Sese, KDD Cup 2001 Report. ACM SIGKDD Explorations, vol. 3, 2002, pp. 1-18. Available from: .
3. D.M. Chickering, C. Meek, Finding optimal Bayesian networks, in: Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, 2002, pp. 94-102.
4. N. Friedman, I. Nachman, D. Peér, Learning Bayesian network structure from massive datasets: the "Sparse Candidate" algorithm, in: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, 1999, pp. 206-215.
5. Gretton A., Herbrich R., Smola A., Bousquet O., and Schölkopf B. Kernel methods for measuring independence. Journal of Machine Learning Research 6 (2005) 2075-2129
6. A. Gretton, A. Smola, O. Bousquet, R. Herbrich, A. Belitski, M. Augath, Y. Murayama, J. Pauls, B. Schölkopf, N. Logothetis, Kernel constrained covariance for dependence measurement, in: Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 2005, pp. 1-8.
7. E.H. Herskovits, Computer-based probabilistic-network construction, Ph.D. Thesis, Stanford University, 1991.
8. C.S. Jensen, Blocking Gibbs sampling for inference in large and complex Bayesian networks with applications in genetics, Ph.D. Thesis, Aalborg University, 1997.
9. R. Kohavi, D. Sommerfield, J. Dougherty, Data mining using MLC++: a machine learning library in C++, in: Tools with Artificial Intelligence, 1996, pp. 234-245.
10. D. Margaritis, S. Thrun, Bayesian network induction via local neighborhoods, in: Proceedings of Neural Information Processing Systems, 2000, pp. 505-511.
11. A. Ng, Preventing "Overfitting" of cross-validation data, in: Proceedings of the Fourteenth International Conference on Machine Learning, 1997, pp. 245-253.
12. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufman
13. J.M. Peña, J. Björkegren, J. Tegnér, Scalable, efficient and correct learning of Markov boundaries under the faithfulness assumption, in: Proceedings of the Eighth European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty, Lecture Notes in Artificial Intelligence, vol. 3571, 2005, pp. 136-147.
14. Peña J.M., Björkegren J., and Tegnér J. Growing Bayesian network models of gene networks from seed genes. Bioinformatics 21 (2005) ii224-ii229
15. Schäfer J., and Strimmer K. An empirical Bayes approach to inferring large-scale gene association networks. Bioinformatics 21 (2005) 754-764
16. Sebastiani P., Gussoni E., Kohane I.S., and Ramoni M. Statistical challenges in functional genomics (with discussion). Statistical Science 18 (2003) 33-60
17. Spirtes P., Glymour C., and Scheines R. Causation, Prediction, and Search (1993), Springer-Verlag
18. Studený M. Probabilistic Conditional Independence Structures (2005), Springer
19. I. Tsamardinos, C.F. Aliferis, A. Statnikov, Algorithms for large scale Markov blanket discovery, in: Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003, pp. 376-380.
20. I. Tsamardinos, C.F. Aliferis, A. Statnikov, Time and sample efficient discovery of Markov blankets and direct causal relations, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 673-678.
21. I. Tsamardinos, C.F. Aliferis, A. Statnikov, Time and sample efficient discovery of Markov blankets and direct causal relations, Technical report DSL TR-03-04, Vanderbilt University, 2003.
22. I. Tsamardinos, L.E. Brown, C.F. Aliferis, The max-min hill-climbing Bayesian network structure learning algorithm, Machine Learning (2006).
23. Weston J., Pérez-Cruz F., Bousquet O., Chapelle O., Elisseeff A., and Schölkopf B. Feature selection and transduction for prediction of molecular bioactivity for drug design. Bioinformatics 19 (2003) 764-771