Abstract
This paper describes a new data mining algorithm to learn Bayesian networks structures based on memory binary particle swarm optimization method and the Minimum Description Length (MDL) principle. An memory binary particle swarm optimization (MBPSO) is proposed. A memory influence is added to a binary particle swarm optimization. The purpose of the added memory feature is to prevent and overcome premature convergence by providing particle specific alternate target points to be used at times instead of the best current position of the particle. In addition, our algorithm, like some previous work, does not need to have a complete variable ordering as input. The experimental results illustrate that our algorithm not only improves the quality of the solutions, but also reduces the time cost.
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
Suzuki, J.: A construction of Bayesian networks from databases based on a MDL scheme. In: Proceedings of the 9th Conference of Uncertainty in Artificial Intelligence, pp. 266–273. Morgan Kaufmann, San Mateo (1993)
Xiang, Y., Wong, S.K.M.: Learning conditional independence relations from a probabilistic model, Department of Computer Science, University of Regina, CA, Tech Rep: CS-94-03 (1994)
Heckerman, D.: Learning Bayesian network: The combination of knowledge and statistic data. Machine Learning 20, 197–243 (1995)
Cheng, J., Greiner, R., Kelly, J.: Learning Bayesian networks from data: An efficient algorithm based on information theory. Artificial Intelligence 137, 43–90 (2002)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: An algorithm based on the MDL principle. Computational Intelligence, 10 (1994)
Larrañaga, P., Poza, M., Yurramendi, Y., Murga, R., Kuijpers, C.: Structure Learning of Bayesian Network by Genetic Algorithms: A Performance Analysis of Control Parameters. IEEE Trans. Pattern Analysis and Machine Intelligence 18, 912–926 (1996)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: an algorithm based on the MDL principle. Computational Intelligence 10, 269–293 (1994)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of IEEE International Conference of Evolutionary Computation, Anchorage, Alaska, May 1998, pp. 69–73 (1998)
Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm optimization algorithm. In: Proceedings of the Conference on Systems, Man, and Cybernetics, pp. 4104–4109 (1997)
Hendtlass, T.: Preserving Diversity in Particle Swarm Optimization. In: Chung, P.W.H., Hinde, C.J., Ali, M. (eds.) IEA/AIE 2003. LNCS, vol. 2718, pp. 31–40. Springer, Heidelberg (2003)
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
Li, XL., Wang, SC., He, XD. (2006). Learning Bayesian Networks Structures Based on Memory Binary Particle Swarm Optimization. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_72
Download citation
DOI: https://doi.org/10.1007/11903697_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47331-2
Online ISBN: 978-3-540-47332-9
eBook Packages: Computer ScienceComputer Science (R0)