摘要
Causal feature selection has received increasing attention in recent years. However, the state-of-the-art causal feature selection algorithms use the conditional independence tests, which require enumerating conditioning sets, leading to an exponential increase in computational complexity along with an increase in feature space. To address this problem, in this paper, we theoretically analyze the unique performance of causal features in mutual information, and propose a novel Causal Feature Selection algorithm using Mutual Information, called CFS-MI. Specifically, CFS-MI separately instantiates the pairwise comparison of mutual information in two stages to reduce computational complexity, and thus improves the efficiency on high-dimensional data. Extensive experiments on 5 benchmark Bayesian networks and 16 real-world datasets validate that CFS-MI has comparable accuracy compared to 7 state-of-the-art causal feature selection algorithms, while presenting more superior computational efficiency.
学科与关键词
- Causal Feature Selection With Efficient Spouses DiscoveryLing, Zhaolong; Li, Bo; Zhang, Yiwen*; Wang, Qingren; Yu, Kui; Wu, XindongIEEE Transactions on Big Data, 2023, 9(2): 555-568.被引 3
- Error-aware Markov blanket learning for causal feature selectionGuo, Xianjie; Yu, Kui*; Cao, Fuyuan; Li, Peipei; Wang, HaoInformation Sciences, 2022, 589: 849-877.被引 21
- Causal Feature Selection in the Presence of Sample Selection BiasYang, Shuai*; Guo, Xianjie; Yu, Kui; Huang, Xiaoling; Jiang, Tingting; He, Jin; Gu, LichuanACM Transactions on Intelligent Systems and Technology, 2023, 14(5): 78.被引 2
