Matching entries: 0
settings...
Santana R and Mühlenbein H (2002), "Blocked Stochastic Sampling versus Estimation of Distribution Algorithms", In Proceedings of the 2002 Congress on Evolutionary Computation CEC-2002. Vol. 2, pp. 1390-1395. IEEE press.
Abstract: The Boltzmann distribution is a good candidate for a search distribution for optimization problems. We compare two methods to approximate the Boltzmann distribution-Estimation of Distribution Algorithms (EDA) and Markov Chain Monte Carlo methods (MCMC). It turns out that in the space of binary functions even blocked MCMC methodsoutperform EDA on a small class of problems only. In these cases a temperature of T=0 performed best
BibTeX:
@inproceedings{Santana_and_Muehlenbein:2002,
  author = {R. Santana and H. Mühlenbein},
  title = {Blocked Stochastic Sampling versus Estimation of Distribution Algorithms},
  booktitle = {Proceedings of the 2002 Congress on Evolutionary Computation CEC-2002},
  publisher = {IEEE press},
  year = {2002},
  volume = {2},
  pages = {1390-1395},
  url = {https://ieeexplore.ieee.org/document/1004446}
}
Santana R, Ochoa A and Soto MR (2002), "Solving problems with integer representation using a tree based factorized distribution algorithm", In Electronic Proceedings of the First International NAISO Congress on Neuro Fuzzy Technologies. NAISO Academic Press.
Abstract: In this paper a tree based Factorized Distribution Algorithm for the solution of integer problems is introduced. Our proposal combines classical methods for structural learning of dependencies with a a procedures that approximates the bivariate marginals by sampling the data using auxiliary tables. Experiments done for a number of problems with an integer representation show evidence of the superiority of the algorithm with respect to the Univariate Marginal Distribution Algorithm.
BibTeX:
@inproceedings{Santana_et_al:2002,
  author = {R. Santana and A. Ochoa and M. R. Soto},
  title = {Solving problems with integer representation using a tree based factorized distribution algorithm},
  booktitle = {Electronic Proceedings of the First International NAISO Congress on Neuro Fuzzy Technologies},
  publisher = {NAISO Academic Press},
  year = {2002},
  url = {http://www.sc.ehu.es/ccwbayes/members/rsantana/papers/2002/Hav2002Final1.pdf}
}
Santana R (2002), "An analysis of the performance of the mixture of trees factorized distribution algorithm when priors and adaptive learning are used". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, March, 2002. (ICIMAF 2002-180)
Abstract: This paper analyzes the behavior of the Mixture of Trees Factorized Distribution Algorithm (MT-FDA) when priors are incorporated. It is shown that the addition of priors that relate the rate of mutation like effect during the search. Adaptive priors that relate the rate of mutation to the quality of the search are also introduced. Additionally, the learning step of the MT-FDA is changed to avoid the overfitting fo data. The results of the experiments show that our proposals improve the trade off between exploration and exploitation displayed by the MT-FDA.
BibTeX:
@techreport{Santana:2002,
  author = {Roberto Santana},
  title = {An analysis of the performance of the mixture of trees factorized distribution algorithm when priors and adaptive learning are used},
  school = {Institute of Cybernetics, Mathematics and Physics},
  year = {2002},
  number = {ICIMAF 2002-180},
  url = {http://www.sc.ehu.es/ccwbayes/members/rsantana/papers/TechReports/RepMutMTFDA.pdf}
}
Santana R (2002), "Study of neighborhood search operators for unitation functions". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, March, 2002. (ICIMAF 2002-185)
Abstract: In this paper we study the behavior of neighborhood search algorithms in optimization of unitation functions. The in
uence of two neighborhood search strategies is analyzed. The expected number of steps required by these algorithms to reach the optimum is derived. The analytical results achieved correspond to previous simulations.
BibTeX:
@techreport{Santana:2002a,
  author = {Roberto Santana},
  title = {Study of neighborhood search operators for unitation functions},
  school = {Institute of Cybernetics, Mathematics and Physics},
  year = {2002},
  number = {ICIMAF 2002-185},
  url = {http://www.sc.ehu.es/ccwbayes/members/rsantana/papers/TechReports/ReportNeigMethods4.pdf}
}