MOTIVATION Bayesian network methods have shown promise in gene regulatory network reconstruction because of their capability of capturing causal relationships between genes and handling data with noises found in biological experiments. The problem of learning network structures, however, is NP hard. Consequently, heuristic methods such as hill climbing are used for structure learning. For netwo...

The method of nearest-neighbor interchange effects local improvements in a binary tree by replacing a 4-subtree by one of its two alternatives if this improves the objective function. We extend this to k-subtrees to reduce the number of local optima. Possible sequences of k-subtrees to be examined are produced by moving a window over the tree, incorporating one edge at a time while deactivating...

Bayesian networks are frequently used to model statistical dependencies in data. Without prior knowledge of dependencies in the data, the structure of a Bayesian network is learned from the data. Bayesian network structure learning is commonly posed as an optimization problem where search is used to find structures that maximize a scoring function. Since the structure search space is superexpon...

| Delta coding is an iterative genetic search strategy that sustains search by periodically re-initializing the population. This helps to avoid premature convergence during genetic search. Delta coding also remaps hyper-space with each iteration in an attempt to locate \easier" search spaces with respect to genetic search. Here, the optimization ability of delta coding is compared against the C...

We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of triplets of instructions (or 3-grams) at the same time as it is learning and sampling a program length distribution. We have tested N-gram GP on symbolic regressions problems where the target function is a polynomial ...

Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting a network with links of minimum total cost in order to make it edge-biconnected, i.e. the failure of a single link will never disconnect any two nodes. A new evolutionary algorithm is proposed that works directly on ...

Study objective: To investigate age, period, and cohort effects on functional status. Design: A prospective cohort study with measurements in 1981, 1990, and 1996. Setting: Three municipalities in north east Finland. Participants: A regionally representative sample of 19 to 63 year old men and women was drawn from the census data in 1979, of which 758 men and 1033 women initially aged 39–63 yea...

We propose an extension of Stabler’s version of clitics treatment for a wider coverage of the french language. For this, we present the lexical entries needed in the lexicon. Then, we show the recognition of complex syntactic phenomenae as (left and right) dislocation, clitic climbing over modal and extraction from determiner phrase. The aim of this presentation is the syntaxsemantic interface ...