Ordinal causal discovery based on Markov blankets

This work focuses on learning causal network structures from ordinal categorical data. By combining constraint-based with score-and-search methodologies in structural learning, we propose a hybrid method called Markov Blanket Based Ordinal Causal Discovery (MBOCD) algorithm, which can capture the ordinal relationship of values in ordinal categorical variables. Theoretically, it is proved that for ordinal causal networks, two adjacent DAGs belonging to the same Markov equivalence class are identifiable, which results in the generation of a causal graph. Simulation experiments demonstrate that the proposed algorithm outperforms existing methods in terms of computational efficiency and accuracy. The code of this work is open at: https://github.com/leoydu/MBOCDcode.git.