Martin Pelikan

Martin Pelikan

Auto-generated profile, based on publicly available information

Martin Pelikan

Google Inc., Mountain View, CA, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2014 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Open access
BHB. Hoda Helmi
B. Hoda Helmi
ARAdel T. Rahmani
Adel T. Rahmani
MPMartin Pelikan
Martin Pelikan
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems are provided as support for the mathematical analysis of the approach. The experiments show that FGGA is capable of learning linkages and solving the optimization problems in polynomial time with a polynomial number of evaluations

12 July 2011
Verified
Conference Paper
Open access
MPMartin Pelikan
Martin Pelikan
Epistasis correlation is a measure that estimates the strength of interactions between problem variables. This paper presents an empirical study of epistasis correlation on a large number of random problem instances of NK landscapes with nearest neighbor interactions. The results are analyzed with respect to the performance of hybrid variants of two evolutionary algorithms: (1) the genetic algorithm with uniform crossover and (2) the hierarchical Bayesian optimization algorithm.


17 May 2022 in arXiv
Verified
Preprint
Open access
PDF file
ABAlexander Brownlee
Alexander Brownlee
MPMartin Pelikan
Martin Pelikan
JMJohn McCall
John McCall
APAndrei Petrovski
Andrei Petrovski
Chemotherapy treatment for cancer is a complex optimisation problem with a large number of interacting variables and constraints. A number of different probabilistic algorithms have been applied to it with varying success. In this paper we expand on this by applying two estimation of distribution algorithms to the problem. One is UMDA, which uses a univariate probabilistic model similar to previously applied EDAs. The other is hBOA, the first EDA using a multivariate probabilistic model to be applied to the chemotherapy problem. While instinct would lead us to predict that the more sophisticated algorithm would yield better performance on a complex problem like this, we show that it is outperformed by the algorithms using the simpler univariate model. We hypothesise that this is caused by the more sophisticated algorithm being impeded by the large number of interactions in the problem which are unnecessary for its solution.

21 February 2005
Verified
Book Chapter
Closed access
PDF file
MPMartin Pelikan
Martin Pelikan