.png){kind=icon}
.png){kind=icon}
Return
Causal Feature Selection With Efficient Spouses Discovery
.png){kind=icon}
PRE
AI
DOI：10.1109/TBDATA.2022.3178472.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Causal feature selection has recently attracted much more attention because it can improve the interpretability of predictive models. However, the existing causal feature selection framework needs to discover the PC (i.e., parents and children) of each variable in the PC of a target variable for spouses discovery, which is time-consuming on high-dimensional data. To tackle this issue, we propose a novel Causal Feature Selection framework with efficient spouses discovery, called CFS. Specifically, by exploiting the dependency change property between a variable and its non-PC, the proposed framework only discovers the PC of the variables in some children of the target variable for spouses discovery. Furthermore, based on the proposed CFS framework and existing PC discovery algorithms, we propose four new causal feature selection algorithms. Using benchmark Bayesian networks and real-world datasets, we experimentally validated the efficiency and accuracy of the proposed algorithms compared with seven state-of-the-art causal feature selection algorithms.
Keywords:
Feature extraction
Markov processes
Big Data
Prediction algorithms
Bayes methods
Predictive models
Benchmark testing
Causal feature selection
Markov blanket
Bayesian network
Journal
I
IF:
5.7
Papers:
834
Citations:
3.0K