Towards scalable and data efficient learning of Markov Boundaries
J.M. Peña, R. Nilsson, J. Björkegren, and J. Tegnér
International Journal of Approximate Reasoning, Volume 45, Issue 2, Pages 211-232, 2007
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.
"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