On open questions in the geometric approach to structural learning Bayesian nets
This paper presents a study on learning Bayesian network (BN) structures from data using the maximization-of-quality criterion. In the BN structure given by an acyclic directed graph \(G\), a certain vector with integers as components is applied. Every reasonable criterion in the form of a linear function plus a constant may be used to learn the BN structure. In this paper, the authors introduce a class of necessary linear constraints on a particular uniquely determined vector, here called the standard imset. Next, they formulate the conjecture that these constraints characterize the polytope \(P\). Thirdly, a previous hypothesis by Raymond Hemmecke that the only vectors with integers as components within \(P\) are standard imsets is confirmed. Three open (mathematical) questions related to this are analyzed in detail and proved. It is my belief that the presented proofs and results are valuable and worthy of notice. Also, the use of the linear transformation \(L\) introduced here makes it possible to simplify the algebraic representation of the BN structure.
- Characteristic imsets for learning Bayesian network structure
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- A geometric view on learning Bayesian network structures
- Polyhedral approaches to learning Bayesian networks
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- 10.1162/153244303321897717
- A characterization of Markov equivalence classes for acyclic digraphs
- A geometric view on learning Bayesian network structures
- A reconstruction algorithm for the essential graph
- Bayesian network learning algorithms using structural restrictions
- Efficient algorithms for conditional independence inference
- Estimating the dimension of a model
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- scientific article; zbMATH DE number 1857870 (Why is no real title available?)
- On the Applications of Mobius Inversion in Combinatorial Analysis
- Three Counter-Examples on Semi-Graphoids
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Algebraic Bayesian networks: checking backbone connectivity
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- Characteristic imsets for learning Bayesian network structure
- Coincidence of the sets of minimal and irreducible join graphs over primary structure of algebraic Bayesian networks
- Core-based criterion for extreme supermodular functions
- Polyhedral approach to statistical learning graphical models
- On polyhedral approximations of polytopes for learning Bayesian networks
- Polyhedral approaches to learning Bayesian networks
- The characteristic imset polytope of Bayesian networks with ordered nodes
- scientific article; zbMATH DE number 1983174 (Why is no real title available?)
- Spectral Bayesian network theory
- A geometric view on learning Bayesian network structures
This page was built for publication: On open questions in the geometric approach to structural learning Bayesian nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q541844)
