手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| NOTEARS: 連続最適化による因果構造学習× | ベイジアンネットワーク× | |
|---|---|---|
| 分野≠ | 因果推論 | ベイズ |
| 系統≠ | Machine learning | Bayesian methods |
| 提唱年≠ | 2018 | 1988 |
| 提唱者≠ | Zheng, Aragam, Ravikumar & Xing | Judea Pearl |
| 種類≠ | Continuous optimization algorithm for causal DAG discovery | Probabilistic graphical model |
| 原典≠ | Zheng, X., Aragam, B., Ravikumar, P., & Xing, E. P. (2018). DAGs with NO TEARS: Continuous optimization for structure learning. Advances in Neural Information Processing Systems, 31. link ↗ | Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann. ISBN: 978-1558604797 |
| 別名≠ | DAGs with NO TEARS, Continuous Structure Learning, Continuous DAG Optimization, Sürekli DAG Yapı Öğrenimi | Bayes network, belief network, probabilistic graphical model, directed graphical model |
| 関連≠ | 1 | 4 |
| 概要≠ | NOTEARS (No Tears: Acyclicity Regression Structure) is a causal structure learning algorithm introduced by Zheng, Aragam, Ravikumar, and Xing in 2018 at NeurIPS. It reformulates the combinatorially hard problem of learning a directed acyclic graph (DAG) from observational data as a continuous, smooth optimization problem, enabling the use of standard gradient-based solvers and removing the need for exhaustive combinatorial search over graph space. | A Bayesian network is a probabilistic graphical model, introduced by Judea Pearl in 1988, that encodes a set of variables and their conditional dependencies as a directed acyclic graph (DAG). Each node represents a variable; each directed edge encodes a direct probabilistic influence. By combining Bayes' rule with the graph's conditional independence structure, the model supports reasoning under uncertainty — computing the probability of any variable given observed evidence about others. |
| ScholarGateデータセット ↗ |
|
|