Practical Markov Boundary Learning without Strong Assumptions

Theoretically, the Markov boundary (MB) is the optimal solution for feature selection. However, existing MB learning algorithms often fail to identify some critical features in real-world feature selection tasks, mainly because the strict assumptions of existing algorithms, on either data distribution, variable types, or correctness of criteria, cannot be satisfied in application scenarios. This paper takes further steps toward opening the door to real-world applications for MB. We contribute in particular to a practical MB learning strategy, which can maintain feasibility and effectiveness in real-world data where variables can be numerical or categorical with linear or nonlinear, pairwise or multivariate relationships. Specifically, the equivalence between MB and the minimal conditional covariance operator (CCO) is investigated, which inspires us to design the objective function based on the predictability evaluation of the mapping variables in a reproducing kernel Hilbert space. Based on this, a kernel MB learning algorithm is proposed, where nonlinear multivariate dependence could be considered without extra requirements on data distribution and variable types. Extensive experiments demonstrate the efficacy of these contributions.

Authors

• Xingyu Wu Hong Kong Polytechnic University
• Bingbing Jiang Hangzhou Normal University
• Tianhao Wu University of Science and Technology of China
• Huanhuan Chen University of Science and Technology of China

Keywords

• ML: Causal Learning
• ML: Dimensionality Reduction/Feature Selection
• RU: Bayesian Networks
• RU: Causality