방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 인과관계 발견 알고리즘 (PC, FCI, LiNGAM)× | 그래프 어텐션 네트워크× | |
|---|---|---|
| 분야≠ | 인과추론 | 딥러닝 |
| 계열≠ | Regression model | Machine learning |
| 기원 연도≠ | 2000 | 2018 |
| 창시자≠ | Spirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM) | Veličković, P. et al. |
| 유형≠ | Causal structure learning | Graph neural network (attention-based) |
| 원전≠ | Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402 | Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗ |
| 별칭≠ | PC algorithm, FCI algorithm, LiNGAM, causal structure learning | Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network |
| 관련≠ | 5 | 4 |
| 요약≠ | Causal discovery is a family of algorithms that automatically learn a directed acyclic graph (DAG) describing causal structure directly from observational data. The constraint-based PC and FCI algorithms were developed by Spirtes, Glymour and Scheines (2000), while the LiNGAM model of Shimizu et al. (2006) exploits linear non-Gaussian structure to orient edges. | The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN). |
| ScholarGate데이터셋 ↗ |
|
|