Abstract
This paper describes techniques for developing a mixture of polynomials (MOP) probability distribution from a frequency distribution (also termed grouped data) summarized from a large dataset. To accomplish this task, a temporary dataset is produced from the grouped data and the parameters for the MOP function are estimated using a Bspline interpolation technique. Guidance is provided regarding the composition of the temporary dataset, and the selection of split points and order of the MOP approximation. Good results are obtained when using grouped data as compared to the underlying dataset, and this can be a major advantage when using a decision support system to obtain information for estimating probability density functions for random variables of interest.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fryer, M.J.: A review of some non-parametric methods of density estimation. Journal of Applied Mathematics 20(3), 335–354 (1977)
Moral, S., RumÃ, R., Salmerón, A.: Mixtures of truncated exponentials in hybrid Bayesian networks. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 156–167. Springer, Heidelberg (2001)
Shenoy, P.P., West, J.C.: Inference in hybrid Bayesian networks using mixtures of polynomials. International Journal of Approximate Reasoning 52(5), 641–657 (2011)
Langseth, H., Nielsen, T., RumÃ, R., Salmerón, A.: Mixtures of truncated basis functions. International Journal of Approximate Reasoning 53(2), 212–227 (2012)
RumÃ, R., Salmerón, A., Moral, S.: Estimating mixtures of truncated exponentials in hybrid bayesian networks. Test 15(2), 397–421 (2006)
Romero, V., RumÃ, R., Salmerón, A.: Learning hybrid bayesian networks using mixtures of truncated exponentials. International Journal of Approximate Reasoning 42(1-2), 54–68 (2006)
Langseth, H., Nielsen, T.D., Rumi, R., Salmerón, A.: Parameter estimation and model selection for mixtures of truncated exponentials. International Journal of Approximate Reasoning 51(5), 485–498 (2010)
Langseth, H., Nielsen, T.D., RumÃ, R., Salmerón, A.: Learning mixtures of truncated basis functions from data. In: Cano, A., Gómez-Olmedo, M., Nielsen, T. (eds.) Proceedings of the Sixth European Conference on Probabilistic Graphical Models (PGM 2012), Granada, Spain, pp. 163–170 (2012)
Cobb, B.R.: Fleet management with cycle time distributions constructed from grouped sample data. Working paper, Missouri State University, Department of Management, Springfield, MO (2014)
López-Cruz, P.L., Bielza, C., Larrañaga, P.: Learning mixtures of polynomials of multidimensional probability densities from data using b-spline interpolation. International Journal of Approximate Reasoning 55(4), 989–1010 (2014)
Shenoy, P.P.: Two issues in using mixtures of polynomials for inference in hybrid Bayesian networks. International Journal of Approximate Reasoning 53(5), 847–866 (2012)
Zong, Z.: Information-Theoretic Methods for Estimating Complicated Probability Distributions. Elsevier, Amsterdam (2006)
Kullback, S., Leibler, R.A.: On information and sufficiency. Annals of Mathematical Statistics 22, 76–86 (1951)
Wolfram, S.: The Mathematica Book, 5th edn. Wolfram Media, Champaign (2003)
Larsen, R.J., Smith, A.F.M.: An Introduction to Mathematical Statistics and its Applications, 3rd edn. Prentice-Hall, Boston (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cobb, B.R. (2014). Mixture of Polynomials Probability Distributions for Grouped Sample Data. In: van der Gaag, L.C., Feelders, A.J. (eds) Probabilistic Graphical Models. PGM 2014. Lecture Notes in Computer Science(), vol 8754. Springer, Cham. https://doi.org/10.1007/978-3-319-11433-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-11433-0_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11432-3
Online ISBN: 978-3-319-11433-0
eBook Packages: Computer ScienceComputer Science (R0)