• DocumentCode
    499070
  • Title

    To enhance continuous estimation of distribution algorithms by density ensembles

  • Author

    Hong, Yi ; Li, He-long ; Kwong, Sam ; Ren, Qing-sheng

  • Author_Institution
    Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong, China
  • Volume
    1
  • fYear
    2009
  • fDate
    12-15 July 2009
  • Firstpage
    95
  • Lastpage
    100
  • Abstract
    This paper deals with using density ensembles methods to enhance continuous estimation of distribution algorithms. In particular, two density ensembles methods are applied: one is resampling method and the other is subspaces method. In resampling continuous estimation of distribution algorithms, a population of densities is obtained by resampling operator and density estimation operator, and new candidate solutions are reproduced by sampling from all obtained densities. In subspaces continuous estimation of distribution algorithms, a population of densities is obtained by randomly selecting a subset of all variables and estimating the density of high quality solutions in this subspace. The above steps iterate and many densities of high quality solutions in different subspaces are achieved. New candidate solutions are reproduced through perturbing old promising solutions in these subspaces.
  • Keywords
    Gaussian distribution; evolutionary computation; learning (artificial intelligence); mathematical operators; sampling methods; set theory; Gaussian distribution; density ensembles method; density estimation operator; distribution algorithm; evolutionary computation method; learning algorithm; probabilistic model; resampling continuous estimation; resampling operator; subset variable selection; subspaces continuous estimation; Cybernetics; Machine learning; Estimation of distribution algorithms; optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2009 International Conference on
  • Conference_Location
    Baoding
  • Print_ISBN
    978-1-4244-3702-3
  • Electronic_ISBN
    978-1-4244-3703-0
  • Type

    conf

  • DOI
    10.1109/ICMLC.2009.5212566
  • Filename
    5212566