방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 인과관계 발견 알고리즘 (PC, FCI, LiNGAM)× | 커뮤니티 탐지× | |
|---|---|---|
| 분야≠ | 인과추론 | 네트워크 분석 |
| 계열≠ | Regression model | Process / pipeline |
| 기원 연도≠ | 2000 | 2002–2019 (algorithm family) |
| 창시자≠ | Spirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM) | Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008) |
| 유형≠ | Causal structure learning | Graph-partitioning / clustering algorithm family |
| 원전≠ | Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402 | Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008. DOI ↗ |
| 별칭≠ | PC algorithm, FCI algorithm, LiNGAM, causal structure learning | graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden) |
| 관련 | 5 | 5 |
| 요약≠ | 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. | Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network? |
| ScholarGate데이터셋 ↗ |
|
|