विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| 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डेटासेट ↗ |
|
|