REVIEW 2 cited by
A simple approach for finding the globally optimal Bayesian network structure
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We study the problem of learning the best Bayesian network structure with respect to a decomposable score such as BDe, BIC or AIC. This problem is known to be NP-hard, which means that solving it becomes quickly infeasible as the number of variables increases. Nevertheless, in this paper we show that it is possible to learn the best Bayesian network structure with over 30 variables, which covers many practically interesting cases. Our algorithm is less complicated and more efficient than the techniques presented earlier. It can be easily parallelized, and offers a possibility for efficient exploration of the best networks consistent with different variable orderings. In the experimental part of the paper we compare the performance of the algorithm to the previous state-of-the-art algorithm. Free source-code and an online-demo can be found at http://b-course.hiit.fi/bene.
Forward citations
Cited by 2 Pith papers
-
GoT-CD: Graph-of-Thoughts Causal Discovery and the Fragility of Post-hoc Path-Specific Fairness Audits
GoT-CD applies graph-of-thoughts reasoning to causal discovery and shows that structural fidelity does not guarantee that a path-specific fairness audit recovers the true sensitive-to-outcome pathway.
-
Inexact Column Generation for Bayesian Network Structure Learning via Difference-of-Submodular Optimization
A DCA-based column generation heuristic learns high-scoring Bayesian networks from Gaussian data, outperforming GOBNILP on BIC score within time limits.
Discussion (0). Continue with ORCID to comment.