Conditional Density Approximations with Mixtures of Polynomials. Issue 3 (24th December 2014)

• Record Type: Journal Article
• Authors: Varando, Gherardo; López‐Cruz, Pedro L.; Nielsen, Thomas D.; Larrañaga, Pedro; Bielza, Concha; Bielza, Concha; Moral, Serafín; Salmerón, Antonio
• Is Part Of: International journal of intelligent systems. Volume 30:Issue 3(2015:Mar.)
• Page Start: 236
• Page End: 264
• Publication Date: 2014-12-24
• Subjects: Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligence artificielle -- Périodiques; Systèmes experts (Informatique) -- Périodiques; 006.3
• DOI: 10.1002/int.21699
• Languages: English
• ISSNs: 0884-8173

Abstract

<abstract abstract-type="main"> <title> <x xml:space="preserve">Abstract</x> </title> <p>Mixtures of polynomials (MoPs) are a nonparametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one‐ and multidimensional (marginal) MoPs from data have recently been proposed. In this paper, we introduce two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities is found. We illustrate and study the methods using data sampled from known parametric distributions, and demonstrate their applicability by learning models based on real neuroscience data. Finally, we compare the performance of the proposed methods with an approach for learning mixtures of truncated basis functions (MoTBFs). The empirical results show that the proposed methods generally yield models that are comparable to or significantly better than those found using the MoTBF‐based method.</p> </abstract>