Value‐based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models
MetadataShow full item record
AuthorGómez Olmedo, Manuel; Cabañas, Rafael; Cano Utrera, Andrés; Moral García, Serafín; Retamero Pascual, Ofelia Paula
John Wiley & Sons
Bayesian networksInference algorithmsInfluence diagramsProbabilistic graphical models
Gómez-Olmedo, M... [et al.]. Value-based potentials: exploiting quantitative information regularity patterns in probabilistic graphical models. Int J Intell Syst. 2021; 1- 31. [https://doi.org/10.1002/int.22573]
SponsorshipSpanish Government PID2019-106758GB-C31 TIN2016-77902-C3-2-P; European Commission
When dealing with complex models (i.e., models with many variables, a high degree of dependency between variables, or many states per variable), the efficient representation of quantitative information in probabilistic graphical models (PGMs) is a challenging task. To address this problem, this study introduces several new structures, aptly named value‐based potentials (VBPs), which are based exclusively on the values. VBPs leverage repeated values to reduce memory requirements. In the present paper, they are compared with some common structures, like standard tables or unidimensional arrays, and probability trees (PT). Like VBPs, PTs are designed to reduce the memory space, but this is achieved only if value repetitions correspond to context‐specific independence patterns (i.e., repeated values are related to consecutive indices or configurations). VBPs are devised to overcome this limitation. The goal of this study is to analyze the properties of VBPs. We provide a theoretical analysis of VBPs and use them to encode the quantitative information of a set of well‐known Bayesian networks, measuring the access time to their content and the computational time required to perform some inference tasks.