방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 인과관계 발견 알고리즘 (PC, FCI, LiNGAM)× | DBSCAN× | |
|---|---|---|
| 분야≠ | 인과추론 | 머신러닝 |
| 계열≠ | Regression model | Machine learning |
| 기원 연도≠ | 2000 | 1996 |
| 창시자≠ | Spirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM) | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. |
| 유형≠ | Causal structure learning | Density-based clustering algorithm |
| 원전≠ | Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402 | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗ |
| 별칭≠ | PC algorithm, FCI algorithm, LiNGAM, causal structure learning | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering |
| 관련≠ | 5 | 3 |
| 요약≠ | 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. | DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes. |
| ScholarGate데이터셋 ↗ |
|
|