| Lozada L and Santana R (2003), "UMDA dynamics for a class of parametric functions". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, September, 2003. (ICIMAF 2003-239)
[BibTeX] |
BibTeX:
@techreport{Lozada_and_Santana:2003,
author = {L. Lozada and R. Santana},
title = {UMDA dynamics for a class of parametric functions},
school = {Institute of Cybernetics, Mathematics and Physics},
year = {2003},
number = {ICIMAF 2003-239}
}
|
| Rodríguez-Ojea LM, Santana R and Soto MR (2003), "Uso de algorithmos evolutivos con estimación de distribuciones en la solución de problemas enteros", In Proceedings of the International Conference INFORMATICA-2004. La Habana, Cuba |
| Abstract: El presente trabajo presenta un análisis del empleo de EDAs basados en modelos gráficos simplemente conectados en la solución de problemas con codificación entera. Se realiza un estudio del desempeño de los EDAs implementados y un análisis empírico del aumento de la complejidad de los referidos algoritmos como consecuencia del paso de la codificación binaria a la codificación entera. |
BibTeX:
@inproceedings{Ojea_et_al:2004,
author = {L. M. Rodríguez-Ojea and R. Santana and M. R. Soto},
title = {Uso de algorithmos evolutivos con estimación de distribuciones en la solución de problemas enteros},
booktitle = {Proceedings of the International Conference INFORMATICA-2004},
year = {2003}
}
|
| Santana R (2003), "MCMC in the approximation and optimization of additive functions: A preliminary study". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba |
| Abstract: This unpublished paper describes the results of different optimization algorithms based on exact and approximate sampling on the solution of additive functions |
BibTeX:
@techreport{Santana:2003,
author = {Roberto Santana},
title = {MCMC in the approximation and optimization of additive functions: A preliminary study},
school = {Institute of Cybernetics, Mathematics and Physics},
year = {2003},
note = {Unpublished manuscript}
}
|
| Santana R (2003), "Factorized Distribution Algorithms: selection without selected population". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, September, 2003. (ICIMAF 2003-240) |
| Abstract: In this paper we investigate the problem of an efficient implementation of the selection step in Factorized Distribution Algorithms. We demonstrate that while in Genetic Algorithms the selection operator needs the creation of a selected population, in Factorized Distribution Algorithms this is not always the case. |
BibTeX:
@techreport{Santana:2003a,
author = {Roberto Santana},
title = {Factorized Distribution Algorithms: selection without selected population},
school = {Institute of Cybernetics, Mathematics and Physics},
year = {2003},
number = {ICIMAF 2003-240},
url = {http://www.sc.ehu.es/ccwbayes/members/rsantana/papers/TechReports/ReportCECSel.pdf}
}
|
| Santana R (2003), "Estimation of Distribution Algorithms with Kikuchi approximations: Part I". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, September, 2003. (ICIMAF 2003-242)
[BibTeX] |
BibTeX:
@techreport{Santana:2003b,
author = {Roberto Santana},
title = {Estimation of Distribution Algorithms with Kikuchi approximations: Part I},
school = {Institute of Cybernetics, Mathematics and Physics},
year = {2003},
number = {ICIMAF 2003-242}
}
|
| Santana R (2003), "A Markov network based factorized distribution algorithm for optimization", In Proceedings of the 14th European Conference on Machine Learning (ECML-PKDD 2003). Dubrovnik, Croatia Vol. 2837, pp. 337-348. Springer. |
| Abstract: In this paper we propose a population based optimization method that uses the estimation of probability distributions. To represent an approximate factorization of the probability, the algorithm employs a junction graph constructed from an independence graph. We show that the algorithm extends the representation capabilities of previous algorithms that use factorizations. A number of functions are used to evaluate the performance of our proposal. The results of the experiments show that the algorithm is able to optimize the functions, outperforming other evolutionary algorithms that use factorizations. |
BibTeX:
@inproceedings{Santana:2003c,
author = {R. Santana},
title = {A Markov network based factorized distribution algorithm for optimization},
booktitle = {Proceedings of the 14th European Conference on Machine Learning (ECML-PKDD 2003)},
publisher = {Springer},
year = {2003},
volume = {2837},
pages = {337-348},
url = {http://dx.doi.org/10.1007/b13633}
}
|
| Santana R (2003), "Estimation of Distribution Algorithms with Kikuchi approximations: Part II". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, September, 2003. (ICIMAF 2003)
[BibTeX] |
BibTeX:
@techreport{Santana:2003d,
author = {Roberto Santana},
title = {Estimation of Distribution Algorithms with Kikuchi approximations: Part II},
school = {Institute of Cybernetics, Mathematics and Physics},
year = {2003},
number = {ICIMAF 2003}
}
|
| Santana R (2003), "Study of neighborhood search operators for unitation functions", In Proceedings of the 17th European Simulation Multiconference ESM-2003. Nottingham, England , pp. 272-277. |
| Abstract: In this paper we study the behavior of neighborhood search algorithms in optimization of unitation functions. The influence 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:
@inproceedings{Santana:2003e,
author = {R. Santana},
title = {Study of neighborhood search operators for unitation functions},
booktitle = {Proceedings of the 17th European Simulation Multiconference ESM-2003},
year = {2003},
pages = {272--277},
url = {www.scs-europe.net/services/esm2003/PDF/AS-21.pdf}
}
|
| Santana R (2003), "Factorized Distribution Algorithms: Selection without selected population", In Proceedings of the 17th European Simulation Multiconference ESM-2003. Nottingham, England , pp. 91-97. |
| Abstract: In this paper we investigate the problem of an efficient implementation of the selection step in Factorized Distribution Algorithms. We demonstrate that while in Genetic Algorithms the selection operator needs the creation of a selected population, in Factorized Distribution Algorithms this is not always the case. |
BibTeX:
@inproceedings{Santana:2003f,
author = {R. Santana},
title = {Factorized Distribution Algorithms: Selection without selected population},
booktitle = {Proceedings of the 17th European Simulation Multiconference ESM-2003},
year = {2003},
pages = {91--97},
url = {https://www.scs-europe.net/services/esm2003/PDF/AI-09.pdf}
}
|
| Santana R (2003), "Automatic construction of valid region based decompositions of graphs", In Proceedings of the Conference of Cuban Society of Computer Science and Mathematics COMPUMAT-2003. Sancti Spiritus, Cuba |
| Abstract: In this paper we propose an algorithm for the construction of valid region based decompositions of graphs. The algorithm is inspired in the Cluster Variation Method used in Statisitical Physics. We illustrate our approach using a number of examples, and show that the algorithm is able to deal with cases where other algorithms fail. |
BibTeX:
@inproceedings{Santana:2003g,
author = {R. Santana},
title = {Automatic construction of valid region based decompositions of graphs},
booktitle = {Proceedings of the Conference of Cuban Society of Computer Science and Mathematics COMPUMAT-2003},
year = {2003}
}
|
| Santana R (2003), "Exact Gibbs sampling in optimization", In Proceedings of the Conference of Cuban Society of Computer Science and Mathematics COMPUMAT-2003. Sancti Spiritus, Cuba |
| Abstract: In this paper we evaluate the convenience of using Exact sampling methods based on Markov chains like optimization algorithms |
BibTeX:
@inproceedings{Santana:2003h,
author = {R. Santana},
title = {Exact Gibbs sampling in optimization},
booktitle = {Proceedings of the Conference of Cuban Society of Computer Science and Mathematics COMPUMAT-2003},
year = {2003}
}
|
| Santana R (2003), "Probabilistic modeling based on undirected graphs in Estimation Distribution Algorithms". Research Report at: Institute of Cybernetics, Mathematics, and Physics (ICIMAF). |
| Abstract: This document contains an initial version of the Ph. D. thesis: Modelación probabilística basada en modelos gráficos no dirigidos en Algoritmos Evolutivos con Estimación de Distribuciones written and presented in Spanish in the University of Havana, Cuba. This version contains results that were not included in the Spanish version and some of which were not published later. In particular, the analysis of quadratic measures for junction trees was not been submmitted for peer-review. I decided to publish this document since it contains a good review of initial work on EDAs and it has been already cited by other authors with no knowledge to access to the final Ph.D. in Spanish. |
BibTeX:
@phdthesis{Santana:2004b,
author = {R. Santana},
title = {Probabilistic modeling based on undirected graphs in Estimation Distribution Algorithms},
school = {Institute of Cybernetics, Mathematics, and Physics (ICIMAF)},
year = {2003},
note = {Unpublished document}
}
|