Towards scalable and data efficient learning of Markov boundaries
We propose algorithms for learning Markov boundaries from data without having to learn a Bayesian network first. We study their correctness, scalability and data efficiency. The last two properties are important because we aim to apply the algorithms to identify the minimal set of features that is needed for probabilistic classification in databases with thousands of features but few instances, e.g. gene expression databases. We evaluate the algorithms on synthetic and real databases, including one with 139.351 features. (C) 2006 Elsevier Inc. All rights reserved.
bayesian networks classification feature subset selection