2,580 research outputs found
Image Pattern Recognition Using Evolutionary Algorithm
The goal of this paper is to investigate and explore evolutionary algorithm performance in image processing. We have made attempt to introduce image pattern recognition by using evolutionary technique. Initially the shape,color and texture feature is extracted from given query image and also for the databases images in a similar manner.Subsequently similar images are retrieved utilizing evolutionary algorithm.Thus by means of evolutionary algorithm required relevant image patterns are retrieved from a large image database based on a given query.The evolutionary algorithm is applied to decide the most plausible matching
Neutral Networks of Real-World Programs and their Application to Automated Software Evolution
The existing software development ecosystem is the product of evolutionary forces, and consequently real-world software is amenable to improvement through automated evolutionary techniques. This dissertation presents empirical evidence that software is inherently robust to small randomized program transformations, or \u27mutations. Simple and general mutation operations are demonstrated that can be applied to software source code, compiled assembler code, or directly to binary executables. These mutations often generate variants of working programs that differ significantly from the original, yet remain fully functional. Applying successive mutations to the same software program uncovers large \u27neutral networks\u27 of fully functional variants of real-world software projects. These properties of \u27mutational robustness\u27 and the corresponding \u27neutral networks\u27 have been studied extensively in biology and are believed to be related to the capacity for unsupervised evolution and adaptation. As in biological systems, mutational robustness and neutral networks in software systems enable automated evolution. The dissertation presents several applications that leverage software neutral networks to automate common software development and maintenance tasks. Neutral networks are explored to generate diverse implementations of software for improving runtime security and for proactively repairing latent bugs. Next, a technique is introduced for automatically repairing bugs in the assembler and executables compiled from off-the-shelf software. As demonstration, a proprietary executable is manipulated to patch security vulnerabilities without access to source code or any aid from the software vendor. Finally, software neutral networks are leveraged to optimize complex nonfunctional runtime properties. This optimization technique is used to reduce the energy consumption of the popular PARSEC benchmark applications by 20% as compared to the best available public domain compiler optimizations. The applications presented herein apply evolutionary computation techniques to existing software using common software engineering tools. By enabling evolutionary techniques within the existing software development toolchain, this work is more likely to be of practical benefit to the developers and maintainers of real-world software systems
Multi-Objective Genetic Algorithm for Multi-View Feature Selection
Multi-view datasets offer diverse forms of data that can enhance prediction
models by providing complementary information. However, the use of multi-view
data leads to an increase in high-dimensional data, which poses significant
challenges for the prediction models that can lead to poor generalization.
Therefore, relevant feature selection from multi-view datasets is important as
it not only addresses the poor generalization but also enhances the
interpretability of the models. Despite the success of traditional feature
selection methods, they have limitations in leveraging intrinsic information
across modalities, lacking generalizability, and being tailored to specific
classification tasks. We propose a novel genetic algorithm strategy to overcome
these limitations of traditional feature selection methods for multi-view data.
Our proposed approach, called the multi-view multi-objective feature selection
genetic algorithm (MMFS-GA), simultaneously selects the optimal subset of
features within a view and between views under a unified framework. The MMFS-GA
framework demonstrates superior performance and interpretability for feature
selection on multi-view datasets in both binary and multiclass classification
tasks. The results of our evaluations on three benchmark datasets, including
synthetic and real data, show improvement over the best baseline methods. This
work provides a promising solution for multi-view feature selection and opens
up new possibilities for further research in multi-view datasets
Adaptive primal-dual genetic algorithms in dynamic environments
This article is placed here with permission of IEEE - Copyright @ 2010 IEEERecently, there has been an increasing interest in applying genetic algorithms (GAs) in dynamic environments. Inspired by the complementary and dominance mechanisms in nature, a primal-dual GA (PDGA) has been proposed for dynamic optimization problems (DOPs). In this paper, an important operator in PDGA, i.e., the primal-dual mapping (PDM) scheme, is further investigated to improve the robustness and adaptability of PDGA in dynamic environments. In the improved scheme, two different probability-based PDM operators, where the mapping probability of each allele in the chromosome string is calculated through the statistical information of the distribution of alleles in the corresponding gene locus over the population, are effectively combined according to an adaptive Lamarckian learning mechanism. In addition, an adaptive dominant replacement scheme, which can probabilistically accept inferior chromosomes, is also introduced into the proposed algorithm to enhance the diversity level of the population. Experimental results on a series of dynamic problems generated from several stationary benchmark problems show that the proposed algorithm is a good optimizer for DOPs.This work was supported in part by the National Nature Science Foundation of China (NSFC) under Grant 70431003 and Grant
70671020, by the National Innovation Research Community Science Foundation
of China under Grant 60521003, by the National Support Plan of China under Grant 2006BAH02A09, by the Engineering and Physical Sciences
Research Council (EPSRC) of U.K. under Grant EP/E060722/1, and by the
Hong Kong Polytechnic University Research Grants under Grant G-YH60
Evolutionary Reinforcement Learning: A Survey
Reinforcement learning (RL) is a machine learning approach that trains agents
to maximize cumulative rewards through interactions with environments. The
integration of RL with deep learning has recently resulted in impressive
achievements in a wide range of challenging tasks, including board games,
arcade games, and robot control. Despite these successes, there remain several
crucial challenges, including brittle convergence properties caused by
sensitive hyperparameters, difficulties in temporal credit assignment with long
time horizons and sparse rewards, a lack of diverse exploration, especially in
continuous search space scenarios, difficulties in credit assignment in
multi-agent reinforcement learning, and conflicting objectives for rewards.
Evolutionary computation (EC), which maintains a population of learning agents,
has demonstrated promising performance in addressing these limitations. This
article presents a comprehensive survey of state-of-the-art methods for
integrating EC into RL, referred to as evolutionary reinforcement learning
(EvoRL). We categorize EvoRL methods according to key research fields in RL,
including hyperparameter optimization, policy search, exploration, reward
shaping, meta-RL, and multi-objective RL. We then discuss future research
directions in terms of efficient methods, benchmarks, and scalable platforms.
This survey serves as a resource for researchers and practitioners interested
in the field of EvoRL, highlighting the important challenges and opportunities
for future research. With the help of this survey, researchers and
practitioners can develop more efficient methods and tailored benchmarks for
EvoRL, further advancing this promising cross-disciplinary research field
Gaps and requirements for applying automatic architectural design to building renovation
The renovation of existing buildings provides an opportunity to change the layout to meet the needs of facilities and accomplish sustainability in the built environment at high utilisation rates and low cost. However, building renovation design is complex, and completing architectural design schemes manually needs more efficiency and overall robustness. With the use of computational optimisation, automatic architectural design (AAD) can efficiently assist in building renovation through decision-making based on performance evaluation. This paper comprehensively analyses AAD's current research status and provides a state-of-the-art overview of applying AAD technology to building renovation. Besides, gaps and requirements of using AAD for building renovation are explored from quantitative and qualitative aspects, providing ideas for future research. The research shows that there is still much work to be done to apply AAD to building renovation, including quickly obtaining input data, expanding optimisation topics, selecting design methods, and improving workflow and efficiency
Digital Ecosystems: Ecosystem-Oriented Architectures
We view Digital Ecosystems to be the digital counterparts of biological
ecosystems. Here, we are concerned with the creation of these Digital
Ecosystems, exploiting the self-organising properties of biological ecosystems
to evolve high-level software applications. Therefore, we created the Digital
Ecosystem, a novel optimisation technique inspired by biological ecosystems,
where the optimisation works at two levels: a first optimisation, migration of
agents which are distributed in a decentralised peer-to-peer network, operating
continuously in time; this process feeds a second optimisation based on
evolutionary computing that operates locally on single peers and is aimed at
finding solutions to satisfy locally relevant constraints. The Digital
Ecosystem was then measured experimentally through simulations, with measures
originating from theoretical ecology, evaluating its likeness to biological
ecosystems. This included its responsiveness to requests for applications from
the user base, as a measure of the ecological succession (ecosystem maturity).
Overall, we have advanced the understanding of Digital Ecosystems, creating
Ecosystem-Oriented Architectures where the word ecosystem is more than just a
metaphor.Comment: 39 pages, 26 figures, journa
Redundancy creates opportunity in developmental representations
This paper investigates the influence of redundancy on the evolutionary performance of a gene regulatory network governing a cellular growth process. Redundancy is believed to play a key role in robustness and evolvability of biological systems. We use a cellular model controlled by a gene regulatory network to evolve elongated morphologies. We show that removing the redundancy in the genome during the evolution decreases the performance of the evolution strategy. A comparing run with few parameters and therefore no redundancy performs worst, which supports the hypothesis that redundancy improves evolvability. © 2011 IEEE
Improving problem definition through interactive evolutionary computation
Poor definition and uncertainty are primary characteristics of conceptual design processes. During the initial stages of these generally human-centric activities, little knowledge pertaining to the problem at hand may be available. The degree of problem definition will depend on information available in terms of appropriate variables, constraints, and both quantitative and qualitative objectives. Typically, the problem space develops with information gained in a dynamical process in which design optimization plays a secondary role, following the establishment of a sufficiently well-defined problem domain. This paper concentrates on background human-computer interaction relating to the machine-based generation of high-quality design information that, when presented in an appropriate manner to the designer, supports a better understanding of a problem domain. Knowledge gained from such information combined with the experiential knowledge of the designer can result in a reformulation of the problem, providing increased definition and greater confidence in the machine-based representation. Conceptual design domains related to gas turbine blade cooling systems and a preliminary air frame configuration are introduced. These are utilized to illustrate the integration of interactive evolutionary strategies that support the extraction of optimal design information, its presentation to the designer, and subsequent human-based modification of the design domain based on knowledge gained from the information received. An experimental iterative designer or evolutionary search process resulting in a better understanding of the problem and improved machine-based representation of the design domain is thus established
- …