Abstract
In this paper, a new method for learning Bayesian networks structure with continuous variables is proposed. The continuous variables are discretized based on hybrid data clustering. The discrete values of a continuous variable are obtained by using father node structure and Gibbs sampling. Optimal dimension of discretized continuous variable is found by MDL principle to the Markov blanket. Dependent relationship is refined by optimization regulation to Bayesian network structure in iteration learning.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cooper, G.F., Herskovits, E.: A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9(4), 309–347 (1992)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: an approach based on the MDL principle. Computational Intelligence 10(4), 269–293 (1994)
Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference, pp. 383–408. Morgan Kaufmann, San Mateo, California (1988)
Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20(3), 197–243 (1995)
Jie, C., Bell, D., Wei-ru, L.: Learning Bayesian networks from data: An efficient approach based on information theory. Artificial Intelligence 137(1-2), 43–90 (2002)
Geiger, D., Heckerman, D.: Learning Gaussian networks. Technical Report MSR-TR-94-10, Microsoft Research, Redmond (1994)
Olesen, K.G.: Causal probabilistic networks with both discrete and continuous variables. IEEE Trans. on Pattern Analysis and Machine Intelligence 3(15), 275–279 (1993)
Xu, L., Jordan, M.I.: On convergence properties of the EM algorithm for Gaussian mixtures. Neural Computation 8(1), 129–151 (1996)
Monti, S., Cooper, G.F.: Learning hybrid Bayesian networks from data. Learning in Graphical Models. Kluwer Academic Publishers, Dordrecht (1998)
Fayyad, U., Irani, K.: Mult-interval discretization of continuous-valued attributes for calssification learning. In: Proceedings International Joint Conference on Artificial Intelligence, Chambery, France, pp. 1022–1027 (1993)
Friedman, N., Goldszmidt, M.: Discretization of continuous attributes while learning Bayesian networks. In: Proceedings 13th International Conference on Machine Learning, Bari, Italy, pp. 157–165 (1996)
Wang, F., Liu, D.Y., Xue, W.X.: Discretizing continuous variables of Bayesian networks based on genetic algorithms. Chinese Journal of Computers 25(8), 794–800 (2002)
Chickering, D.M.: Learning Bayesian networks is NP-Hard. Technical Report MSR-TR-94-17, Microsoft Research, Redmond (1994)
Mao, S.S., Wang, J.L., Pu, X.L.: Advanced mathematical statistics, 1st edn., pp. 401–459. China Higher Education Press, Beijing, Springer, Berlin (1998)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence 6(6), 721–742 (1984)
Buntine, W.L.: Chain graphs for learning. In: Besnard, P., Hanks, S. (eds.) Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, pp. 46–54. Morgan Kaufmann, San Francisco (1995)
Domingos, P., Pazzani, M.: On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning 29(2-3), 103–130 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, SC., Li, XL., Tang, HY. (2006). Learning Bayesian Networks Structure with Continuous Variables. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_49
Download citation
DOI: https://doi.org/10.1007/11811305_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37025-3
Online ISBN: 978-3-540-37026-0
eBook Packages: Computer ScienceComputer Science (R0)