Learning mixtures of polynomials from data using B-spline interpolation

Hybrid Bayesian networks eciently encode a joint probabil ity distribution over a set of continuous and discrete variables. Several approaches have been recently proposed for working with hybrid Bayesian networks, e.g., mixtures of truncated basis functions, mixtures of truncated exponentials or mixtures of polynomials (MoPs). We present a method for learning MoP approximations of probability densities from data using a linear combination of B-splines. Maximum likelihood estimators of the mixing coecients of the linear combination are computed, and model selection is performed using a penalized likelihood criterion, i.e., the BIC score. Artificial examples are used to analyze the behavior of the method according to dierent criteria, like the qualit y of the approximations and the number of pieces in the MoP. Also, we study the use of the proposed method as a non-parametric density estimation technique in naive Bayes (NB) classifiers. Results on real datasets show that the non-parametric NB classifier using MoPs is comparable to the kernel density-based NB and better than Gaussian or discrete NB classifiers.

[1]  Serafín Moral,et al.  Mixtures of Truncated Exponentials in Hybrid Bayesian Networks , 2001, ECSQARU.

[2]  Zhi Zong Information-theoretic methods for estimating complicated probability distributions , 2006 .

[3]  Prakash P. Shenoy,et al.  Axioms for probability and belief-function proagation , 1990, UAI.

[4]  Rafael Rumí,et al.  Parameter estimation and model selection for mixtures of truncated exponentials , 2010, Int. J. Approx. Reason..

[5]  Serafín Moral,et al.  Estimating mixtures of truncated exponentials in hybrid bayesian networks , 2006 .

[6]  Rafael Rumí,et al.  Mixtures of truncated basis functions , 2012, Int. J. Approx. Reason..

[7]  S. García,et al.  An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons , 2008 .

[8]  Usama M. Fayyad,et al.  Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning , 1993, IJCAI.

[9]  I. J. Schoenberg Contributions to the problem of approximation of equidistant data by analytic functions. Part A. On the problem of smoothing or graduation. A first class of analytic approximation formulae , 1946 .

[10]  Marvin Minsky,et al.  Steps toward Artificial Intelligence , 1995, Proceedings of the IRE.

[11]  I. J. Schoenberg Contributions to the Problem of Approximation of Equidistant Data by Analytic Functions , 1988 .

[12]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[13]  Prakash P. Shenoy Two issues in using mixtures of polynomials for inference in hybrid Bayesian networks , 2012, Int. J. Approx. Reason..

[14]  I. Faux,et al.  Computational Geometry for Design and Manufacture , 1979 .

[15]  Prakash P. Shenoy,et al.  Inference in hybrid Bayesian networks using mixtures of polynomials , 2011, Int. J. Approx. Reason..