• [email protected]
  • +971 507 888 742
Submit Manuscript
SciAlert
  • Home
  • Journals
  • Information
    • For Authors
    • For Referees
    • For Librarian
    • For Societies
  • Contact
  1. Journal of Software Engineering
  2. Vol 9 (3), 2015
  3. 451-468
  • Issues
    Online First Current Issue All Issues
  • Information About
    Aims and Scope Editorial Board Guide to Authors Article Processing Charges
    Submit a Manuscript

Journal of Software Engineering

Year: 2015 | Volume: 9 | Issue: 3 | Page No.: 451-468
DOI: 10.3923/jse.2015.451.468

Facebook Twitter Reddit Linkedin E-mail
Google Scholar ASCI
Research Article

Comparison of Effects of Different Learning Methods on Estimation of Distribution Algorithms

Caichang Ding
State Key Laboratory of Software Engineering, Wuhan University, Wuhan, 430072, China

Lixin Ding
School of Computer Science, Yangtze University, Jingzhou, 434023, China

Wenxiu Peng
School of Computer, Wuhan University, Wuhan, 430072, China

This study investigates Estimation of Distribution Algorithms (EDAs) based Bayesian networks with KS learning method. The EDAs based Bayesian networks are used to analyze the effect of learning the best structure in the search. By using KS learning method that can learn optimal Bayesian networks, two important issues in EDAs are studied. First, we discuss that whether learning a more perfect depending model leads to a better behave of EDAs. Second, when a perfect learning is accomplished, we are able to observe that how is the problem structure transformed into the probabilistic model. Several different kinds of experiments have been conducted. The experimental results show that when the accuracy of the learning is increasing, the quality of the problem information learned by the probabilistic model can also be improved. However, the improvements in model accuracy do not mean a more efficient search at all times.
PDF Fulltext XML References Citation

How to cite this article

Caichang Ding, Lixin Ding and Wenxiu Peng, 2015. Comparison of Effects of Different Learning Methods on Estimation of Distribution Algorithms. Journal of Software Engineering, 9: 451-468.

DOI: 10.3923/jse.2015.451.468

URL: https://scialert.net/abstract/?doi=jse.2015.451.468

Leave a Comment


Your email address will not be published. Required fields are marked *

Article Trend



Total views 2142

References


  1. Abdollahzadeh, A., A. Reynolds, M. Christie, D.W. Corne, B.J. Davies and G.J. Williams, 2012. Bayesian optimization algorithm applied to uncertainty quantification. SPE J., 17: 865-873.
    CrossRef

  2. Ahn, C.W., J. An and J.C. Yoo, 2012. Estimation of particle swarm distribution algorithms: Combining the benefits of PSO and EDAs. Inform. Sci., 192: 109-119.
    CrossRefDirect Link

  3. Armananzas, R., Y. Saeys, I. Inza, M. Garcia-Torres, C. Bielza, Y. Van de Peer and P. Larranaga, 2011. Peakbin selection in mass spectrometry data using a consensus approach with estimation of distribution algorithms. IEEE/ACM Trans. Comput. Biol. Bioinform., 8: 760-774.
    CrossRefDirect Link

  4. Barber, D., 2012. Bayesian Reasoning and Machine Learning. Cambridge University Press, Cambridge, MA., USA., ISBN-13: 9780521518147, Pages: 697.

  5. Bensi, M., A.D. Kiureghian and D. Straub, 2013. Efficient Bayesian network modeling of systems. Reliab. Eng. Syst. Saf., 112: 200-213.
    CrossRefDirect Link

  6. Blanco, R., I. Inza and P. Larranaga, 2003. Learning Bayesian networks in the space of structures by estimation of distribution algorithms. Int. J. Intell. Syst., 18: 205-220.
    CrossRefDirect Link

  7. Bonawitz, E., S. Denison, T.L. Griffiths and A. Gopnik, 2014. Probabilistic models, learning algorithms and response variability: Sampling in cognitive development. Trends Cognit. Sci., 18: 497-500.
    CrossRefDirect Link

  8. Boussaid, I., J. Lepagnot and P. Siarry, 2013. A survey on optimization metaheuristics. Inform. Sci., 237: 82-117.
    CrossRefDirect Link

  9. Buntine, W., 1991. Theory refinement on Bayesian networks. Proceedings of the 7th Conference on Uncertainty in Artificial Intelligence, July 13-15, 1991, Los Angeles, CA., USA., pp: 52-60.

  10. Ceberio, J., E. Irurozki, A. Mendiburu and J.A. Lozano, 2014. A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans. Evol. Comput., 18: 286-300.
    CrossRef

  11. Chang, P.C. and M.H. Chen, 2014. A block based estimation of distribution algorithm using bivariate model for scheduling problems. Soft Comput., 18: 1177-1188.
    CrossRefDirect Link

  12. Chen, T., K. Tang, G. Chen and X. Yao, 2010. Analysis of computational time of simple estimation of distribution algorithms. IEEE Trans. Evol. Comput., 14: 1-22.
    CrossRefDirect Link

  13. Daly, R., Q. Shen and S. Aitken, 2011. Learning Bayesian networks: Approaches and issues. Knowledge Eng. Rev., 26: 99-157.
    CrossRef

  14. Darwiche, A., 2010. Bayesian networks. Commun. ACM, 53: 80-90.
    CrossRefDirect Link

  15. Etxeberria, R. and P. Larranaga, 1999. Global optimization using Bayesian networks. Proceedings of the 2nd Symposium on Artificial Intelligence, March 1999, Habana, Cuba, pp: 332-339.

  16. Fan, J., Y. Liang, Q. Xu, R. Jia and Z. Cui, 2011. EDA-USL: Unsupervised clustering algorithm based on estimation of distribution algorithm. Int. J. Wireless Mobile Comput., 5: 88-97.
    CrossRef

  17. Friedman, N., D. Geiger and M. Goldszmidt, 1997. Bayesian network classifiers. Mach. Learn., 29: 131-163.
    CrossRefDirect Link

  18. Griffiths, T.L., N. Chater, C. Kemp, A. Perfors and J.B. Tenenbaum, 2010. Probabilistic models of cognition: Exploring representations and inductive biases. Trends Cognit. Sci., 14: 357-364.
    CrossRef

  19. Hauschild, M.W., M. Pelikan, K. Sastry and D.E. Goldberg, 2012. Using previous models to bias structural learning in the hierarchical BOA. Evol. Comput., 20: 135-160.
    CrossRefDirect Link

  20. Hauschild, M. and M. Pelikan, 2011. An introduction and survey of estimation of distribution algorithms. Swarm Evol. Comput., 1: 111-128.
    CrossRefDirect Link

  21. Hauschild, M., M. Pelikan, K. Sastry and C. Lima, 2009. Analyzing probabilistic models in hierarchical BOA. IEEE Trans. Evol. Comput., 13: 1199-1217.
    CrossRef

  22. Jin, C. and S.W. Jin, 2014. Software reliability prediction model based on support vector regression with improved estimation of distribution algorithms. Applied Soft Comput., 15: 113-120.
    CrossRefDirect Link

  23. Koivisto, M. and K. Sood, 2004. Exact Bayesian structure discovery in Bayesian networks. J. Mach. Learn. Res., 5: 549-573.
    Direct Link

  24. Koller, D. and N. Friedman, 2009. Probabilistic Graphical Models: Principles and Techniques. 1st Edn., The MIT Press, New York, USA., ISBN-13: 9780262013192, Pages: 1280.

  25. Larranaga, P. and J.A. Lozano, 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluewer Academic Publishers, Boston, MA., USA., ISBN-13: 978-0792374664, Pages: 382.

  26. Li, X., S. Mabu and K. Hirasawa, 2014. A novel graph-based estimation of the distribution algorithm and its extension using reinforcement learning. IEEE Trans. Evol. Comput., 18: 98-113.
    Direct Link

  27. Lima, C.F., M. Pelikan, D.E. Goldberg, F.G. Lobo, K. Sastry and M. Hauschild, 2007. Influence of selection and replacement strategies on linkage learning in BOA. Proceedings of the IEEE Congress on Evolutionary Computation, September 25-28, 2007, Singapore, pp: 1083-1090.
    CrossRef

  28. Martins, J.P. and A.C. Delbem, 2014. Efficiency enhancement of estimation of distribution algorithms by a compressed tournament selection. J. Intell. Fuzzy Syst., 26: 2537-2545.
    CrossRef

  29. Muelas, S., A. Mendiburu, A. LaTorre and J.M. Pena, 2014. Distributed estimation of distribution algorithms for continuous optimization: How does the exchanged information influence their behavior? Inform. Sci., 268: 231-254.
    CrossRefDirect Link

  30. Reeves, C.R., 2010. Genetic Algorithms. In: Handbook of Metaheuristics, Gendreau, M. and J.Y. Potvin (Eds.). Springer, New York, USA., ISBN-13: 9781441916631, pp: 109-139.

  31. Shim, V.A., K.C. Tan and C.Y. Cheong, 2012. A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem. IEEE Trans. Syst. Man Cybern. C: Applic. Rev., 42: 682-691.
    CrossRef

  32. Wang, F.S. and L.H. Chen, 2013. Genetic Algorithms. In: Encyclopedia of Systems Biology, Dubitzky, W., O. Wolkenhauer, K.H. Cho and H. Yokota (Eds.). Springer, New York, USA., ISBN-13: 9781441998620, pp: 819-820.

Keywords


  • EDAs
  • probabilistic model
  • problem structure
  • learning structure

Useful Links

  • Journals
  • For Authors
  • For Referees
  • For Librarian
  • For Socities

Contact Us

Office Number 1128,
Tamani Arts Building,
Business Bay,
Deira, Dubai, UAE

Phone: +971 507 888 742
Email: [email protected]

About Science Alert

Science Alert is a technology platform and service provider for scholarly publishers, helping them to publish and distribute their content online. We provide a range of services, including hosting, design, and digital marketing, as well as analytics and other tools to help publishers understand their audience and optimize their content. Science Alert works with a wide variety of publishers, including academic societies, universities, and commercial publishers.

Follow Us
© Copyright Science Alert. All Rights Reserved