|
A Distributed Architecture for Data Mining and Integration
|
2009 |
|
This paper presents the rationale for a new architecture to support a signi�cant increase in the scale of data integration and data mining. It proposes the composition into one framework of... [more details]
|
| |
|
A novel visual discriminator on network traffic pattern
|
2008 |
|
The wavelet transform has been shown to be a powerful tool for characterising network traffic. However, the resulting decomposition of a wavelet transform typically forms a high-dimension space. This... [more details]
|
| |
|
Data Integration in eHealth: A Domain/Disease Specific Roadmap
|
2007 |
|
The paper documents a series of data integration workshops held in 2006 at the UK National e-Science Centre, summarizing a range of the problem/solution scenarios in multi-site and multi-scale data integration... [more details]
|
| |
|
Evolutionary Computation in Combinatorial Optimization, 7th European Conference
|
2007 |
|
Metaheuristics have often been shown to be effective for difficult combinatorial
optimization problems appearing in various industrial, economical, and scientific
domains. Prominent examples of metaheuristics... [more details]
|
| |
|
European Graduate Student Workshop on Evolutionary Computation
|
2007 |
|
Evolutionary computation involves the study of problem-solving and optimization techniques inspired by principles of evolution and genetics. As any other scientific field, its success relies on the continuity... [more details]
|
| |
|
Mining spatial gene expression data for association rules
|
2007 |
|
We analyse data from the Edinburgh Mouse Atlas Gene-Expression Database (EMAGE) which is a high quality data source for spatio-temporal gene expression patterns. Using a novel process whereby generated... [more details]
|
| |
|
European Graduate Student Workshop on Evolutionary Computation
|
2006 |
|
Evolutionary computation involves the study of problem-solving and optimization techniques inspired by principles of evolution and genetics. As any other scientific field, its success relies on the continuity... [more details]
|
| |
|
Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO
|
2006 |
|
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable neighbourhood search (VNS),... [more details]
|
| |
|
Evolving combinatorial problem instances that are difficult to solve
|
2006 |
|
In this paper we demonstrate how evolutionary computation can be used to acquire difficult to solve combinatorial problem instances, thereby stress-testing the corresponding algorithms used to solve these... [more details]
|
| |
|
Increasing the efficiency of graph colouring algorithms with a representation based on vector operations
|
2006 |
|
We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of graph colouring algorithms. Moreover, this model provides... [more details]
|
| |
|
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
|
2006 |
|
We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, our model provides useful information... [more details]
|
| |
|
Evolutionary Transitions as a Metaphor for Evolutionary Optimization
|
2005 |
|
This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specifically it incorporates mechanisms... [more details]
|
| |
|
Genetic Programming, Proceedings of the 8th European Conference
|
2005 |
|
Annex slipsole matriarchy assured drydock pixel uniflagellate wink autarkic debugger recaption autoloading pseudostratified dichromatopsia?
Interconnecting leaser devolution... [more details]
|
| |
|
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
|
2005 |
|
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics that exploit information... [more details]
|
| |
|
Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population
|
2005 |
|
This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary... [more details]
|
| |
|
Property analysis of symmetric travelling salesman problem instances acquired through evolution
|
2005 |
|
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then... [more details]
|
| |
|
Transition Models as an incremental approach for problem solving in Evolutionary Algorithms
|
2005 |
|
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model. It lets building units of a solution... [more details]
|
| |
|
Binary Merge Model Representation of the Graph Colouring Problem
|
2004 |
|
This paper describes a novel representation and ordering model that aided by an evolutionary algorithm, is used in solving the graph \emph{k}-colouring problem. Its strength lies in reducing the search... [more details]
|
| |
|
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
|
2004 |
|
We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported,... [more details]
|
| |
|
Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems
|
2004 |
|
In this article, we try to provide insight into the consequence of mutation and crossover rates when solving binary constraint satisfaction problems. This insight is based on a measurement of the space... [more details]
|
| |
|
A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems
|
2004 |
|
We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems.... [more details]
|
| |
|
Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation
|
2004 |
|
This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps consisting of clustered nodes. Uniform... [more details]
|
| |
|
A new permutation model for solving the graph k-coloring problem
|
2003 |
|
This paper describes a novel representation and ordering model, that is aided by an evolutionary algorithm, is used in solving the graph k-coloring. A comparison is made between the new representation... [more details]
|
| |
|
Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems
|
2003 |
|
Constraint handling is not straightforward in evolutionary algorithms (EA) since the usual search operators, mutation and recombination, are `blind' to constraints. Nevertheless, the issue is highly relevant,... [more details]
|
| |
|
Evolving binary constraint satisfaction problem instances that are difficult to solve
|
2003 |
|
We present a study on the difficulty of solving binary constraint satisfaction problems where an evolutionary algorithm is used to explore the space of problem instances. By directly altering the structure... [more details]
|
| |
|
Application of Evolutionary Computation to Constraint Satisfaction and Data Mining
|
2002 |
|
A limited number of hardcopies is available for those who are interested, drop me an e-mail. Contents (chapter level):
\begin{itemize}
\item 1. Introduction
\item 2. Evolutionary Computation
\item... [more details]
|
| |
|
Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction
|
2002 |
|
In this paper we present a new tool to measure the efficiency of evolutionary algorithms by storing the whole searched space of a run, a process whereby we gain insight into the number of distinct points... [more details]
|
| |
|
Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
|
2002 |
|
Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms,... [more details]
|
| |
|
Use of Evolutionary Algorithms for Telescope Scheduling
|
2002 |
|
LOFAR, a new radio telescope, will be designed to observe with up to 8 independent beams, thus allowing several simultaneous observations. Scheduling of multiple observations parallel in time, each having... [more details]
|
| |
|
An Engineering Approach to Evolutionary Art
|
2001 |
|
We present a general system that evolves art on the Internet. The system runs on a server which enables it to collect information about its usage world wide; its core uses operators and representations... [more details]
|
| |
|
Evolutionary Computation in Constraint Satisfaction and Machine Learning --- An abstract of my PhD.
|
2001 |
|
Annex slipsole matriarchy assured drydock pixel uniflagellate wink autarkic debugger recaption autoloading pseudostratified dichromatopsia?
Interconnecting leaser devolution... [more details]
|
| |
|
A Futurist approach to dynamic environments
|
2001 |
|
The optimization of dynamic environments has proved to be a difficult area for Evolutionary Algorithms. As standard haploid populations find it difficult to track a moving target, diffKerent schemes have... [more details]
|
| |
|
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
|
2001 |
|
In this paper we continue our study on adaptive genetic pro-gramming. We use Stepwise Adaptation of Weights to boost performance of a genetic programming algorithm on simple symbolic regression problems.... [more details]
|
| |
|
An Engineering Approach to Evolutionary Art
|
2001 |
|
We present a general system that evolves art on the Internet. The system runs on a server which enables it to collect information about its usage world wide; its core uses operators and representations... [more details]
|
| |
|
A Futurist approach to dynamic environments
|
2001 |
|
We present a general system that evolves art on the Internet. The system runs on a server which enables it to collect information about its usage world wide; its core uses operators and representations... [more details]
|
| |
