mlsanityData to 7 Oct 2026

Learning Bayesian Networks with Local Structure

arXiv 1302.3577 ↗First posted 13 Feb 2013cs.AI cs.LG stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly represents and learns the local structure in the conditional probability tables (CPTs), that quantify these networks. This increases the space of possible models, enabling the representation of CPTs with a variable number of parameters that depends on the learned local structures. The resulting learning procedure is capable of inducing models that better emulate the real complexity of the interactions present in the data. We describe the theoretical foundations and practical aspects of learning local structures, as well as an empirical evaluation of the proposed method. This evaluation indicates that learning curves characterizing the procedure that exploits the local structure converge faster than these of the standard procedure. Our results also show that networks learned with local structure tend to be more complex (in terms of arcs), yet require less parameters.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Feb 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 3; 2023: 1; 2024: 0; 2025: 0; 2026: 1.

9 papers.