A survey on Bayesian network structure learning from data

M Scanagatta, A Salmerón, F Stella - Progress in Artificial Intelligence, 2019 - Springer
A necessary step in the development of artificial intelligence is to enable a machine to
represent how the world works, building an internal structure from data. This structure should …

CPS data streams analytics based on machine learning for Cloud and Fog Computing: A survey

X Fei, N Shah, N Verba, KM Chao… - Future generation …, 2019 - Elsevier
Cloud and Fog computing has emerged as a promising paradigm for the Internet of things
(IoT) and cyber–physical systems (CPS). One characteristic of CPS is the reciprocal …

[PDF][PDF] High-dimensional learning of linear causal networks via inverse covariance estimation

PL Loh, P Bühlmann - The Journal of Machine Learning Research, 2014 - jmlr.org
We establish a new framework for statistical estimation of directed acyclic graphs (DAGs)
when data are generated from a linear, possibly non-Gaussian structural equation model …

The complexity of bayesian network learning: Revisiting the superstructure

R Ganian, V Korchemna - Advances in Neural Information …, 2021 - proceedings.neurips.cc
We investigate the parameterized complexity of Bayesian Network Structure Learning
(BNSL), a classical problem that has received significant attention in empirical but also …

A short note of the relationship between loose tangles and filters

T Fujita - International Journal of Mathematics Trends and …, 2024 - ijmttjournal.org
Tangle, a concept related to graph width parameters, has been defined and studied in graph
theory. It has a dual relationship with branch width. Loose Tangle relaxes the axioms of …

Approximate structure learning for large Bayesian networks

M Scanagatta, G Corani, CP De Campos, M Zaffalon - Machine Learning, 2018 - Springer
We present approximate structure learning algorithms for Bayesian networks. We discuss
the two main phases of the task: the preparation of the cache of the scores and structure …

Learning treewidth-bounded Bayesian networks with thousands of variables

M Scanagatta, G Corani… - Advances in neural …, 2016 - proceedings.neurips.cc
We present a method for learning treewidth-bounded Bayesian networks from data sets
containing thousands of variables. Bounding the treewidth of a Bayesian network greatly …

Learning optimal bounded treewidth Bayesian networks via maximum satisfiability

J Berg, M Järvisalo, B Malone - Artificial Intelligence and …, 2014 - proceedings.mlr.press
Bayesian network structure learning is the well-known computationally hard problem of
finding a directed acyclic graph structure that optimally describes given data. A learned …

Turbocharging treewidth-bounded Bayesian network structure learning

VP Ramaswamy, S Szeider - Proceedings of the AAAI Conference on …, 2021 - ojs.aaai.org
We present a new approach for learning the structure of a treewidth-bounded Bayesian
Network (BN). The key to our approach is applying an exact method (based on MaxSAT) …

Learning Bayesian networks in the presence of structural side information

E Mokhtarian, S Akbari, F Jamshidi, J Etesami… - Proceedings of the …, 2022 - ojs.aaai.org
We study the problem of learning a Bayesian network (BN) of a set of variables when
structural side information about the system is available. It is well known that learning the …