An efficient and scalable algorithm for local bayesian network structure discovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6323 LNAI, Issue PART 3, 2010, Pages 164-179

  De Morais, Sérgio Rodrigues ^a   Aussem, Alex ^a  

^a NONE

Author keywords

Bayesian network structure learning; constraint based methods; feature selection

Indexed keywords

BAYESIAN NETWORK STRUCTURE; CONSTRAINT-BASED; DIMENSIONALITY REDUCTION; DIVIDE AND CONQUER; DRUG DESIGN; EMPIRICAL EXPERIMENTS; FEATURE SELECTION; LARGE NEIGHBORHOOD; REAL WORLD DATA; RUNTIMES; SAMPLE SIZES; SCALABLE ALGORITHMS;

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; FEATURE EXTRACTION; INFERENCE ENGINES; INTELLIGENT NETWORKS; LEARNING SYSTEMS; STATISTICAL TESTS;

BAYESIAN NETWORKS;

EID: 77958041308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15939-8_11     Document Type: Conference Paper

References (21)

1. Aliferis, C., Tsamardinos, I., Statnikov, A., Brown, L.: Causal explorer: A causal probabilistic network learning toolkit for biomedical discovery. In: Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, METMBS, Las Vegas, Nevada, USA, pp. 23-26. CSREA Press (2003)
2. Aussem, A., de Morais, S.R., Corbex, M.: Nasopharyngeal carcinoma data analysis with a novel Bayesian network skeleton learning. In: Bellazzi, R., Abu-Hanna, A., Hunter, J. (eds.) AIME 2007. LNCS (LNAI), vol. 4594, pp. 326-330. Springer, Heidelberg (2007) (Pubitemid 47545214)
3. Brown, L.E., Tsamardinos, I.: A strategy for making predictions under manipula-tion. In: JMLR: Workshop and Conference Proceedings, vol. 3, pp. 35-52 (2008)
4. Cawley, G.: Causal and non-causal feature selection for ridge regression. In: JMLR: Workshop and Conference Proceedings, vol. 3 (2008)
5. Cheng, J., Hatzis, C., Hayashi, H., Krogel, M.A., Morishita, S., Page, D., Sese, J.: KDD Cup 2001 Report. In: ACM SIGKDD Explorations, pp. 1-18 (2002)
6. Chickering, D.: Learning equivalence classes of bayesian-network structures. Ma-chine Learning 2, 445-498 (2002)
7. Friedman, N.L., Nachman, I., Pe'er, D.: Learning bayesian network structure from massive datasets: the "sparse candidate" algorithm. In: Laskey, K.B., Prade, H. (eds.) Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence, pp. 21-30. Morgan Kaufmann Publishers, San Francisco (1999)
8. Fu, S., Desmarais, M.: Tradeoff analysis ofdifferent Markov blanket local learning approaches. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 562-571. Springer, Heidelberg (2008) (Pubitemid 351776348)
9. Guyon, I., Aliferis, C., Cooper, G., Elisseef, A., Pellet, J.P., Statnikov, P.A.: Design and analysis of the causation and prediction challenge. In: JMLR: Workshop and Conference Proceedings, vol. 1, pp. 1-16. MIT Press, Boston (2008)
10. Neapolitan, R.E.: Learning Bayesian Networks. Pearson Prentice Hall, Upper Sad-dle River (2004)
11. Peña, J.M., Nilsson, R., Bj̈orkegren, J., Tegńer, J.: Towards scalable and data ef-ficient learning of Markov boundaries. International Journal of Approximate Rea-soning 45(2), 211-232 (2007)
12. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
13. Pearl, J.: Causality: Models, Reasoning, and Inference. Cambridge University Press, Cambridge (2000)
14. Peña, J.: Learning gaussian graphical models ofgene networks with false discovery rate control. In: Marchiori, E., Moore, J.H. (eds.) EvoBIO 2008. LNCS, vol. 4973, pp. 165-176. Springer, Heidelberg (2008)
15. Rodrigues de Morais, S., Aussem, A.: A novel scalable and data efficient feature subset selection algorithm. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part II. LNCS (LNAI), vol. 5212, pp. 298-312. Springer, Heidelberg (2008)
16. Rodrigues de Morais, S., Aussem, A.: A novel Markov boundary based feature subset selection algorithm. Neurocomputing 73, 578-584 (2010)
17. Rodrigues de Morais, S., Aussem, A., Corbex, M.: Handling almost-deterministic relationships in constraint-based Bayesian network discovery: Application to can-cer risk factor identification. In: 16th European Symposium on Artificial Neural Networks ESANN'08, pp. 101-106 (2008)
18. Steck, H.: Learning the Bayesian network structure: Dirichlet prior vs data. In: Conference on Uncertainty in Artificial Intelligence UAI'08, pp. 511-518 (2008)
19. Tsamardinos, I., Aliferis, C.F., Statnikov, A.R.: Algorithms for large scale Markov blanket discovery. In: Florida Artificial Intelligence Research Society Conference FLAIRS'03, pp. 376-381 (2003)
20. Tsamardinos, I., Brown, L.E., Aliferis, C.F.: The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning 65(1), 31-78 (2006)
21. Tsamardinos, I., Brown, L.E.: Bounding the false discovery rate in local Bayesian network learning. In: Proceedings AAAI National Conference on AI AAAI'08, pp. 1100-1105 (2008)