Scalable, efficient and correct learning of markov boundaries under the faithfulness assumption

Authors:
Jose M. Peña;Johan Björkegren;Jesper Tegnér
Affiliations:
Computational Biology, Department of Physics and Measurement Technology, Linköping University, Sweden;Center for Genomics and Bioinformatics, Karolinska Institutet, Sweden;Computational Biology, Department of Physics and Measurement Technology, Linköping University, Sweden
Venue:
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2005

Citing 6
Cited 8

Computer-based probabilistic-network construction

Computer-based probabilistic-network construction
Bayesian Network Classifiers

Machine Learning - Special issue on learning with probabilistic representations
KDD Cup 2001 report

ACM SIGKDD Explorations Newsletter
Time and sample efficient discovery of Markov blankets and direct causal relations

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning Bayesian Networks

Learning Bayesian Networks
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Consistent Feature Selection for Pattern Recognition in Polynomial Time

The Journal of Machine Learning Research
Towards scalable and data efficient learning of Markov boundaries

International Journal of Approximate Reasoning
A hybrid Bayesian network learning method for constructing gene networks

Computational Biology and Chemistry
Adapting Bayes network structures to non-stationary domains

International Journal of Approximate Reasoning
Using Markov Blankets for Causal Structure Learning

The Journal of Machine Learning Research
Robust Gene Selection from Microarray Data with a Novel Markov Boundary Learning Method: Application to Diabetes Analysis

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Incremental Bayesian Network Learning for Scalable Feature Selection

IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Local Causal and Markov Blanket Induction for Causal Discovery and Feature Selection for Classification Part I: Algorithms and Empirical Evaluation

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for learning the Markov boundary of a random variable from data without having to learn a complete Bayesian network. The algorithm is correct under the faithfulness assumption, scalable and data efficient. The last two properties are important because we aim to apply the algorithm to identify the minimal set of random variables that is relevant for probabilistic classification in databases with many random variables but few instances. We report experiments with synthetic and real databases with 37, 441 and 139352 random variables showing that the algorithm performs satisfactorily.