Efficient Learning of Bayesian Networks with Bounded Tree-width

Learning Bayesian networks with bounded tree-width has attracted much attention recently, because low tree-width allows exact inference to be performed efficiently. Some existing methods \cite{korhonen2exact, nie2014advances} tackle the problem by using $k$-trees to learn the optimal Bayesian network with tree-width up to $k$. Finding the best $k$-tree, however, is computationally intractable. In this paper, we propose a sampling method to efficiently find representative $k$-trees by introducing an informative score function to characterize the quality of a $k$-tree. To further improve the quality of the $k$-trees, we propose a probabilistic hill climbing approach that locally refines the sampled $k$-trees. The proposed algorithm can efficiently learn a quality Bayesian network with tree-width at most $k$. Experimental results demonstrate that our approach is more computationally efficient than the exact methods with comparable accuracy, and outperforms most existing approximate methods.

Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems

The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the retrieval process chooses those cases which are sub attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependant upon problem specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialisation method for local search methods such as Hill Climbing, Tabu Search and Simulated Annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialisation method for these approaches.

Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems

This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and the case base. Experimental results are analysed and related research issues for future work are discussed.

Multiple-retrieval case-based reasoning for course timetabling problems

The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the retrieval process chooses those cases which are sub attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependant upon problem specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialisation method for local search methods such as Hill Climbing, Tabu Search and Simulated Annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialisation method for these approaches.

Réseau calculant asynchrone dédié à la segmentation d'images

National audience

Nurse Rostering with Genetic Algorithms

In recent years genetic algorithms have emerged as a useful tool for the heuristic solution of complex discrete optimisation problems. In particular there has been considerable interest in their use in tackling problems arising in the areas of scheduling and timetabling. However, the classical genetic algorithm paradigm is not well equipped to handle constraints and successful implementations usually require some sort of modification to enable the search to exploit problem specific knowledge in order to overcome this shortcoming. This paper is concerned with the development of a family of genetic algorithms for the solution of a nurse rostering problem at a major UK hospital. The hospital is made up of wards of up to 30 nurses. Each ward has its own group of nurses whose shifts have to be scheduled on a weekly basis. In addition to fulfilling the minimum demand for staff over three daily shifts, nurses’ wishes and qualifications have to be taken into account. The schedules must also be seen to be fair, in that unpopular shifts have to be spread evenly amongst all nurses, and other restrictions, such as team nursing and special conditions for senior staff, have to be satisfied. The basis of the family of genetic algorithms is a classical genetic algorithm consisting of n-point crossover, single-bit mutation and a rank-based selection. The solution space consists of all schedules in which each nurse works the required number of shifts, but the remaining constraints, both hard and soft, are relaxed and penalised in the fitness function. The talk will start with a detailed description of the problem and the initial implementation and will go on to highlight the shortcomings of such an approach, in terms of the key element of balancing feasibility, i.e. covering the demand and work regulations, and quality, as measured by the nurses’ preferences. A series of experiments involving parameter adaptation, niching, intelligent weights, delta coding, local hill climbing, migration and special selection rules will then be outlined and it will be shown how a series of these enhancements were able to eradicate these difficulties. Results based on several months’ real data will be used to measure the impact of each modification, and to show that the final algorithm is able to compete with a tabu search approach currently employed at the hospital. The talk will conclude with some observations as to the overall quality of this approach to this and similar problems.

Multiple cutout optimization in composite plates using evolutionary structural optimization

The optimization of cutouts in composite plates was investigated by implementing a procedure known as Evolutionary Structural Optimization. Perforations were introduced into a finite element mesh of the plate from which one or more cutouts of a predetermined size were evolved. In the examples presented, plates were rejected from around each evolving cutout based on a predefined rejection criterion. The Limiting ply within each plate element around the cutout was determined based on the Tsai-Hill failure criterion. Finite element plates with values below the product of the average Tsai-Hill number and a rejection criterion were subsequently removed. This process was iterated until a steady state was reached and the rejection criterion was then incremented by an evolutionary rate and the above steps repeated until the desired cutout area was achieved. Various plates with differing lay-up and loading parameters were investigated to demonstrate the generality and robustness of this optimization procedure.

Sex differences in the programming effects of prenatal stress on psychopathology and stress responses: an evolutionary perspective

There is strong evidence from animal studies that prenatal stress has different effects on male and female offspring. In general, although not always, prenatal stress increases anxiety, depression and stress responses, both hypothalamic–pituitary–adrenal and cardiovascular, in female offspring rather than in male. Males are more likely to show learning and memory deficits. There have been few studies so far in humans which differentiate effects of prenatal stress on male and female psychopathology. Some studies support the animal models, but the evidence is inconsistent. The mediating mechanisms for any sex specific effects are little understood, but there is evidence that placental function can differ depending on the sex of the fetus. We suggest that there may be an evolutionary reason for any sex differences in the long term effects of prenatal stress. In a stressful environment it may be adaptive for females, who are more likely to stay in one place and look after children, to be more vigilant, alert to danger and thus show more stress responsiveness. This can give rise to a more anxious or depressed phenotype. With males it may be more adaptive to go out and explore new environments, compete with other males, and be more aggressive. For this it may help to be less responsive to external stressors. More research is needed into sex differences in the effects of prenatal stress in humans, to test these ideas.

Small mammals of the mid-Araguaia River in central Brazil, with the description of a new species of climbing rat

The mid-Araguaia River basin in central Brazil is considered a priority area for biodiversity conservation, and Parque Estadual do Cantao (PEC) is one of the most important protected areas in this ecotone between Cerrado and Amazonia. This area suffers an intensive human pressure with high rates of deforestation, and still remains poorly studied in terms of biodiversity. From June 2007 to November 2008 we sampled small mammals from both banks of the mid-Araguaia River, in the states of Tocantins and Para. Data are given about morphological traits, geographic distribution and natural history of 22 species of small non-volant mammals (eight marsupials and 14 rodents) surveyed at PEC and its surroundings. We also present mitochondrial phylogenetic analyses that allow species identification within the genera: Oecomys, Oligoryzomys and Rhipidomys, and delineate an undescribed species of Thrichomys. Based on morphologic and molecular data, we describe a new species of Rhipidomys previously assigned to R. nitela, which is apparently endemic to the Araguaia-Tocantins basin in the Cerrado. Additionally, our phylogenetic analyses provide support for the role played by the Araguaia River as an important geographic barrier for two sister species of Rhipidomys.

Extrafloral nectary morphology and the role of environmental constraints in shaping its traits in a common Cerrado shrub (Maprounea brasiliensis A. St.-Hill: Euphorbiaceae)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems

Efficient hill climbers have been recently proposed for single- and multi-objective pseudo-Boolean optimization problems. For $k$-bounded pseudo-Boolean functions where each variable appears in at most a constant number of subfunctions, it has been theoretically proven that the neighborhood of a solution can be explored in constant time. These hill climbers, combined with a high-level exploration strategy, have shown to improve state of the art methods in experimental studies and open the door to the so-called Gray Box Optimization, where part, but not all, of the details of the objective functions are used to better explore the search space. One important limitation of all the previous proposals is that they can only be applied to unconstrained pseudo-Boolean optimization problems. In this work, we address the constrained case for multi-objective $k$-bounded pseudo-Boolean optimization problems. We find that adding constraints to the pseudo-Boolean problem has a linear computational cost in the hill climber.