The sample complexity of learning fixed-structure Bayesian networks

DOI10.1023/A:1007417612269zbMath0892.68078OpenAlexW1608211738MaRDI QIDQ1380858

Sanjoy Dasgupta

Publication date: 11 March 1998

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007417612269

zbMATH Keywords

Bayesian networksPAC learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Learning Bayesian network parameters from small data sets: a further constrained qualitatively maximum a posteriori method, Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu, Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers