Semiparametric Bayesian networks

DOI10.1016/J.INS.2021.10.074MaRDI QIDQ6188204zbMATH OpenOpenAlexFDO

Authors David Atienza, Concha Bielza, Pedro Larrañaga

Publication date 1 February 2024

Published in Information Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

continuous datasemiparametric modelBayesian networkskernel density estimation

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Abstract: We introduce semiparametric Bayesian networks that combine parametric and nonparametric conditional probability distributions. Their aim is to incorporate the advantages of both components: the bounded complexity of parametric models and the flexibility of nonparametric ones. We demonstrate that semiparametric Bayesian networks generalize two well-known types of Bayesian networks: Gaussian Bayesian networks and kernel density estimation Bayesian networks. For this purpose, we consider two different conditional probability distributions required in a semiparametric Bayesian network. In addition, we present modifications of two well-known algorithms (greedy hill-climbing and PC) to learn the structure of a semiparametric Bayesian network from data. To realize this, we employ a score function based on cross-validation. In addition, using a validation dataset, we apply an early-stopping criterion to avoid overfitting. To evaluate the applicability of the proposed algorithm, we conduct an exhaustive experiment on synthetic data sampled by mixing linear and nonlinear functions, multivariate normal data sampled from Gaussian Bayesian networks, real data from the UCI repository, and bearings degradation data. As a result of this experiment, we conclude that the proposed algorithm accurately learns the combination of parametric and nonparametric components, while achieving a performance comparable with those provided by state-of-the-art methods.

Cites work

• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 1844469 (Why is no real title available?)
• scientific article; zbMATH DE number 847282 (Why is no real title available?)
• Addendum on the scoring of Gaussian directed acyclic graphical models
• An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
• Bandwidth Packing: A Tabu Search Approach
• Bayesian classifiers based on kernel density estimation: flexible classifiers
• Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
• Discrete Bayesian network classifiers: a survey
• Inference in hybrid Bayesian networks using mixtures of polynomials
• Mixtures of truncated basis functions
• Multivariate density estimation. Theory, practice, and visualization
• Order-independent constraint-based causal structure learning
• Probabilistic graphical models.
• Statistical comparisons of classifiers over multiple data sets
• The max-min hill-climbing Bayesian network structure learning algorithm
• Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms

Cited in

(2)

• Hybrid semiparametric Bayesian networks
• Rejoinder on: ``Hybrid semiparametric Bayesian networks

This page was built for publication: Semiparametric Bayesian networks

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