We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Materials Science/Pruning Bayesian networks for computationally tractable multi-model calibration
PeriodicalsMaterials Science

Pruning Bayesian networks for computationally tractable multi-model calibration

Checking your access to this record.

Abstract & Overview

Anomaly response in aerospace systems increasingly relies on multi-model analysis in digital twins to replicate the system’s behaviors and inform decisions. However, computer model calibration methods are typically deployed on individual models and are limited in their ability to capture dependencies across models. In addition, model heterogeneity has been a significant issue in integration efforts. Bayesian Networks are well suited for multi-model calibration tasks as they can be used to formulate a mathematical abstraction of model components and encode their relationship in a probabilistic and interpretable manner. The computational cost of this method however increases exponentially with the graph complexity. In this work, we propose a graph pruning algorithm to reduce computational cost while minimizing the loss in calibration ability by incorporating domain-driven metrics for selection purposes. We implement this method using a Python wrapper for BayesFusion software and show that the resulting prediction accuracy outperforms existing pruning approaches which rely primarily on statistics.

Cite this record

Nicolas Gratius, Mario E. Berges, Burcu Akinci (2025). Pruning Bayesian networks for computationally tractable multi-model calibration. Frontiers in Aerospace Engineering, 4. https://doi.org/10.3389/fpace.2025.1522006

Copy in another style

Gratius, N., Berges, M. E., & Akinci, B. (2025). Pruning Bayesian networks for computationally tractable multi-model calibration. Frontiers in Aerospace Engineering, 4. https://doi.org/10.3389/fpace.2025.1522006
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.