{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:58:10Z","timestamp":1760151490637,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T00:00:00Z","timestamp":1647993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This article proposes the usage of the d-separation criterion in Markov Boundary Discovery algorithms, instead of or alongside the statistical tests of conditional independence these algorithms usually rely on. This is a methodological improvement applicable when designing, studying or improving such algorithms, but it is not applicable for productive use, because computing the d-separation criterion requires complete knowledge of a Bayesian network. Yet Bayesian networks can be made available to the algorithms when studied in controlled conditions. This approach has the effect of removing sources of suboptimal behavior, allowing the algorithms to perform at their theoretical best and providing insights about their properties. The article also discusses an extension of this approach, namely to use d-separation as a complement to the usual statistical tests performed on synthetic datasets in order to ascertain the overall accuracy of the tests chosen by the algorithms, for further insights into their behavior. To exemplify these two approaches, two Markov Boundary Discovery algorithms were used, namely the Incremental Association Markov Blanket algorithm and the Iterative Parent\u2013Child-Based Search of Markov Blanket algorithm. Firstly, these algorithms were configured to use d-separation alone as their conditional independence test, computed on known Bayesian networks. Subsequently, the algorithms were configured to use the statistical G-test complemented by d-separation to evaluate their behavior on synthetic data.<\/jats:p>","DOI":"10.3390\/a15040105","type":"journal-article","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T12:20:25Z","timestamp":1648038025000},"page":"105","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing Markov Boundary Discovery Algorithms in Ideal Conditions Using the d-Separation Criterion"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2900-4251","authenticated-orcid":false,"given":"Camil","family":"B\u0103ncioiu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Electrical Engineering, Lucian Blaga University of Sibiu, 550024 Sibiu, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8100-1379","authenticated-orcid":false,"given":"Remus","family":"Brad","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Electrical Engineering, Lucian Blaga University of Sibiu, 550024 Sibiu, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1214\/09-SS057","article-title":"Causal inference in statistics: An overview","volume":"3","author":"Pearl","year":"2009","journal-title":"Stat. Surv."},{"key":"ref_2","unstructured":"Pearl, J. (2008). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Kaufmann."},{"key":"ref_3","unstructured":"Fu, S., and Desmarais, M.C. (2010, January 10\u201312). Markov blanket based feature selection: A review of past decade. Proceedings of the World Congress on Engineering, San Francisco, CA, USA."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Spirtes, P., Glymour, C., and Scheines, R. (2000). Causation, Prediction, and Search, MIT Press.","DOI":"10.7551\/mitpress\/1754.001.0001"},{"key":"ref_5","unstructured":"Aliferis, C.F., Tsamardinos, I., and Statnikov, A. (2003, January 8\u201312). HITON: A novel Markov Blanket algorithm for optimal variable selection. Proceedings of the AMIA Annual Symposium Proceedings. American Medical Informatics Association, Washington, DC, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Tsamardinos, I., Aliferis, C.F., and Statnikov, A. (2003, January 24\u201327). 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, Washington, DC, USA.","DOI":"10.1145\/956750.956838"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.ijar.2006.06.008","article-title":"Towards scalable and data efficient learning of Markov boundaries","volume":"45","author":"Pena","year":"2007","journal-title":"Int. J. Approx. Reason."},{"key":"ref_8","unstructured":"Koller, D., and Sahami, M. (1995, January 19\u201324). Toward optimal feature selection. Proceedings of the In 13th International Conference on Machine Learning, Lake Tahoe, CA, USA."},{"key":"ref_9","unstructured":"Tsamardinos, I., Aliferis, C., Statnikov, A., and Statnikov, E. (2003, January 12\u201314). Algorithms for Large Scale Markov Blanket Discovery. Proceedings of the 16th International FLAIRS Conference, St. Augustine, FL, USA."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"B\u0103ncioiu, C., and Brad, R. (2021). Accelerating Causal Inference and Feature Selection Methods through G-Test Computation Reuse. Entropy, 23.","DOI":"10.3390\/e23111501"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Fu, S., and Desmarais, M.C. (2008, January 13\u201315). Fast Markov blanket discovery algorithm via local learning within single pass. Proceedings of the Conference of the Canadian Society for Computational Studies of Intelligence, Ottawa, ON, Canada.","DOI":"10.1007\/978-3-540-68825-9_10"},{"key":"ref_12","first-page":"27","article-title":"Conditional likelihood maximisation: A unifying framework for information theoretic feature selection","volume":"13","author":"Brown","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"B\u0103ncioiu, C., and Vintan, L. (2017, January 19\u201321). A Comparison between Two Feature Selection Algorithms. Proceedings of the ICSTCC 2017, Sinaia, Romania.","DOI":"10.1109\/ICSTCC.2017.8107041"},{"key":"ref_14","first-page":"85","article-title":"Efficiency Optimizations for Koller and Sahami\u2019s feature selection algorithm","volume":"22","author":"Vintan","year":"2019","journal-title":"Rom. J. Inf. Sci. Technol."},{"key":"ref_15","unstructured":"Margaritis, D., and Thrun, S. (2000, January 7\u201310). Bayesian network induction via local neighborhoods. Proceedings of the Advances in Neural Information Processing Systems, Denver, CO, USA."},{"key":"ref_16","unstructured":"Fu, S. (2010). Efficient Learning of Markov Blanket and Markov Blanket Classifier. [Ph.D. Thesis, \u00c9cole Polytechnique de Montr\u00e9al]."},{"key":"ref_17","unstructured":"B\u0103ncioiu, C. (2022, February 22). MBTK, a Library for Studying Markov Boundary Algorithms. Available online: https:\/\/github.com\/camilbancioiu\/mbtk."},{"key":"ref_18","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience. [2nd ed.]."},{"key":"ref_19","unstructured":"Koller, D., and Friedman, N. (2009). Probabilistic Graphical Models: Principles and Techniques, MIT Press."},{"key":"ref_20","unstructured":"Scutari, M. (2020). bnlearn\u2014An R Package for Bayesian Network Learning and Inference, UCL Genetics Institute, University College."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/4\/105\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:41:23Z","timestamp":1760136083000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/4\/105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,23]]},"references-count":20,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["a15040105"],"URL":"https:\/\/doi.org\/10.3390\/a15040105","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,3,23]]}}}