Bayesian network learning via topological order

zbMATH1440.90083MaRDI QIDQ4637014FDOQ4637014

Authors

Publication date 17 April 2018

Full work available at URL https://arxiv.org/abs/1701.05654

zbMATH Keywords

networksdirected acyclic graphsGaussian Bayesian networktopological orders

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Recommendations

• Integer linear programming for the Bayesian network structure learning problem
• Structural learning of Bayesian networks using local algorithms based on the space of orderings
• An optimization approach for structural learning Bayesian networks based on prior node ordering
• scientific article; zbMATH DE number 1735979
• Constrained likelihood for reconstructing a directed acyclic Gaussian graph

Cites work

• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 1489805 (Why is no real title available?)
• 10.1162/153244303321897717
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A Minimax Theorem for Directed Graphs
• A branch and bound algorithm for the acyclic subgraph problem
• Approximating minimum feedback sets and multicuts in directed graphs
• Approximations for the maximum acyclic subgraph problem
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• Concave penalized estimation of sparse Gaussian Bayesian networks
• Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
• Exclusion Regions for Systems of Equations
• Finding a minimum feedback arc set in reducible flow graphs
• Introduction to algorithms.
• Learning Bayesian networks: The combination of knowledge and statistical data
• Learning Causal Bayesian Network Structures From Experimental Data
• Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
• Lifting for mixed integer programs with variable upper bounds
• More facets from fences for linear ordering and acyclic subgraph polytopes
• New Facets of the Linear Ordering Polytope
• On the acyclic subgraph polytope
• Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
• Reducibility among combinatorial problems
• Sparse inverse covariance estimation with the graphical lasso
• Structure discovery in Bayesian networks by sampling partial orders
• The strongest facets of the acyclic subgraph polytope are unknown
• \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs

Cited in

(3)

• Learning Bayesian network parameters under order constraints
• Order priors for Bayesian network discovery with an application to malware phylogeny
• Gaussian Bayesian network comparisons with graph ordering unknown

Describes a project that uses

Uses Software

• R
• pcalg
• glasso

This page was built for publication: Bayesian network learning via topological order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637014)