Name
Abstract | ||
|---|---|---|
Existing causal discovery algorithms are usually not effective and efficient enough on high dimensional data. Because the high dimensionality reduces the discovered accuracy and increases the computation complexity. To alleviate these problems, we present a three-phase approach to learn the structure of nonlinear causal models by taking the advantage of feature selection method and two state of the art causal discovery methods. In the first phase, a greedy search method based on Max-Relevance and Min-Redundancy is employed to discover the candidate causal set, a rough skeleton of the causal network is generated accordingly. In the second phase, constraint-based method is explored to discover the accurate skeleton from the rough skeleton. In the third phase, direction learning algorithm IGCI is conducted to distinguish the direction of causalities from the accurate skeleton. The experimental results show that the proposed approach is both effective and scalable, particularly with interesting findings on the high dimensional data. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10489-014-0607-0 | Applied Intelligence |
Keywords | Field | DocType |
Causal discovery,Max-relevance,Min-redundancy | Data mining,Clustering high-dimensional data,Nonlinear system,Feature selection,Computer science,Greedy algorithm,Curse of dimensionality,Artificial intelligence,Computation complexity,Machine learning,Scalability,Causal model | Journal |
Volume | Issue | ISSN |
42 | 3 | 0924-669X |
Citations | PageRank | References |
2 | 0.39 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhifeng Hao | 1 | 653 | 78.36 |
| Hao Zhang | 2 | 2 | 0.39 |
| Ruichu Cai | 3 | 241 | 37.07 |
| Wen Wen | 4 | 37 | 5.92 |
| Zhihao Li | 5 | 136 | 17.95 |