Scalable, efficient and correct learning of Markov Boundaries under the faithfulness assumption
J.M. Peña, J. Björkegrenand, J. Tegnér
In Proceedings of the Eighth European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty (ECSQARU 2005) – Lecture Notes in Artificial Intelligence 3571, 136-147, 2005
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.
"KAUST shall be a beacon for peace, hope and reconciliation, and shall serve the people of the Kingdom and the world."
King Abdullah bin Abdulaziz Al Saud, 1924 – 2015
Thuwal 23955-6900, Kingdom of Saudi Arabia