BIOINFORMATICS ORIGINAL PAPER (2008)
Gene Expression, Kristof Engelen, Bart Naudts, Bart De Moor, Kathleen Marchal
Vol. 22 no. 10 2006, pages 1251–1258 doi:10.1093/bioinformatics/btl068 A calibration method for estimating absolute expression levels from microarray data
Koenraad Van Leemput, Bart Naudts, Piet Van Remortel, Alain Verschoren, Bart De Moor, ...
SynTReN: a generator of biologically plausible synthetic gene expression data for design and analysis of structure
Longpaths for the Genetic Algorithm (Extended Abstract) (2007)
Introduction A path of an iterative search procedure is the recording of a succession of states of this procedure over one particular course of its search for the optimum. A path of a genetic...
University of Antwerp, RUCA, (2007)
When solving constraint satisfaction problems (CSPs) with stochastic search algorithms (SSAs) using the standard penalty function, it is not possible to show that there is no solution for a problem...
On Functions with a Fixed Fitness Versus Distance-to-Optimum Relation (2007)
Leila Kallel, Bart Naudts, Marc Schoenauer
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the correlation value cannot be...
A Motivated Definition of Exploitation and Exploration (2007)
Bart Naudts, Adriaan Schippers
This paper can be seen as an exercise in formal reasoning to provide a well-understood, unambiguous definition of the terms exploitation and exploration. It is not our aim to distill a common...
An Object Model for Search Spaces and Their Transformations (2007)
Ives Landrieu, Ives L, Bart Naudts
. This paper proposes an object model for a generic optimization framework centered around two concepts: search spaces and transformations of search spaces. We define and discuss the model's...
The Analysis of a Recombinative Hill-Climber on (2007)
Re I He, Computat I Onal, I Ntell, I Gence, Clarissa Van Hoyweghen, Ingo Wegener, ...
Abstract--- Many experiments have proved that crossover is an essential search operator in evolutionary algorithms, at least for certain functions. However, the rigorous analysis of such algorithms...
From TwoMax to the Ising Model: easy and hard (2007)
Clarissa Van Hoyweghen, Clarissa Van Hoyweghen, David E. Goldberg, David E. Goldberg, Bart Naudts, Bart Naudts
symmetrical problems
Van Den Bulcke, Tim, Van Leemput, Koenraad, Naudts, Bart, Van Remortel, Piet, Ma, Hongwu, Verschoren, Alain, ...
Abstract Background The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validation of these...
Kristof Engelen, Bart Naudts, Bart De Moor, Kathleen Marchal
Motivation: We describe an approach to normalizing spotted microarray data, based on a physically motivated calibration model. This model consists of two major components, describing the...
A calibration method for estimating absolute expression levels from microarray data (2006)
Engelen, Kristof, Naudts, Bart, De Moor, Bart, Marchal, Kathleen
Motivation: We describe an approach to normalize spotted microarray data, based on a physically motivated calibration model. This model consists of two major components, describing the hybridization...
Walter Daelemans, Véronique Hoste, Fien De Meulder, Bart Naudts
Abstract. Comparative machine learning experiments have become an important methodology in empirical approaches to natural language processing (i) to investigate which machine learning algorithms...
Daelemans, Walter, Hoste, Veronique, De Meulder, Fien, Naudts, Bart
Comparative machine learning experiments have become an important methodology in empirical approaches to natural language processing (i) to investigate which machine learning algorithms have the...
The analysis of a recombinative hill climber on HIFF (2002)
Dietzfelbinger, Martin, Hoyweghen, Clarissa Van, Naudts, Bart, Wegener, Ingo
Building block superiority, multimodality and synchronization problems (2001)
Clarissa Van Hoyweghen, Clarissa Van Hoyweghen, David E. Goldberg, David E. Goldberg, Bart Naudts, Bart Naudts
The working of a genetic algorithm is usually explained by the search for superior building blocks. Building blocks with above average tness are combined to construct higher order building blocks....
Comparison of Summary Statistics of Fitness Landscapes (2000)
This paper studies a number of predictive measures of problem difficulty, amongst which epistasis variance and fitness distance correlation are the most widely known. Our approach is based on...
On functions with a given fitness--distance relation (1999)
Kallel, Leila, Naudts, Bart, Schoenauer, Marc
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the fitness distance correlation (FDC)...
On functions with a given fitness--distance relation (1999)
Kallel, Leila, Naudts, Bart, Schoenauer, Marc
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the fitness distance correlation (FDC)...
On functions with a given fitness--distance relation (1999)
Kallel, Leila, Naudts, Bart, Schoenauer, Marc
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the fitness distance correlation (FDC)...
Luk Schoofs, Bart Naudts, Ives Landrieu, Ives L
In this paper we investigate the behavior of mutation-based evolutionary algorithms on highly symmetric binary constraint satisfaction problems. With empirical methods we study why and when these...
On Functions With a Given Fitness-Distance Relation (1999)
Leila Kallel, Bart Naudts, Marc Schoenauer
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the fitness distance correlation (FDC)...
SGA Search Dynamics on Second Order Functions (1998)
. By comparing its search dynamics to that of a simple O(n 2 ) heuristic, we are able to analyze the behavior of the simple genetic algorithm on second order functions, whose optimization is shown to...
Departement Wiskunde-informatica, Bart Naudts, Short Summary
s of all the papers of the journal are there. . http://www.ieee.org/pub_preview/evc_toc.html gives the table of contents of the latest IEEE Transactions on EC. . http://www.genetic-algorithm.org may...
Epistasis as a Basic Concept in Formal Landscape Analysis (1997)
Bart Naudts, Dominique Suys, Alain Verschoren
In this note we measure the interdependency of bits in the encoding of a fitness function using two different invariants. The first invariant, normalized epistasis, features a strong correlation with...