mlsanityData to 7 Oct 2026

Bayesian Network Learning via Topological Order

arXiv 1701.05654 ↗First posted 20 Jan 2017stat.ML cs.DScited by 14

Not on the map. Why?

Abstract (arXiv)

We propose a mixed integer programming (MIP) model and iterative algorithms based on topological orders to solve optimization problems with acyclic constraints on a directed graph. The proposed MIP model has a significantly lower number of constraints compared to popular MIP models based on cycle elimination constraints and triangular inequalities. The proposed iterative algorithms use gradient descent and iterative reordering approaches, respectively, for searching topological orders. A computational experiment is presented for the Gaussian Bayesian network learning problem, an optimization problem minimizing the sum of squared errors of regression models with L1 penalty over a feature network with application of gene network inference in bioinformatics.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jan 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 2; 2023: 5; 2024: 2; 2025: 1; 2026: 1.

14 papers.

Sort:

By area: