FIFTHTM: A Stack Based GP Language for Vector Processing

This paper demonstrates that FIFTH™, a new vector-based genetic programming (GP) language, can automatically derive very effective signal processing algorithms directly from signal data. Using symbol rate estimation as an example, we compare the performance of a standard algorithm against an evolved algorithm. The evolved algorithm uses a novel approach in developing a symbol transition feature vector and achieves an impressive 97.7% overall accuracy in the defined problem domain, far exceeding the performance of the standard algorithm. These results suggest that vector based GP approaches could be useful in developing more expressive features for a large class of signal processing and classification problems.

2010

ii iii

In this paper, we propose a multilayer domainindependent GP-based approach to feature extraction and image classification. We propose two different structures for the system and compare the results with a baseline approach in which domain-specific pre-extracted features are used for classification. In the baseline approach, human/domain expert intervention is required to perform the task of feature extraction. The proposed approach, however, extracts (evolves) features and generates classifiers all automatically in one loop. The experiments are conducted on four image data sets. The results show that the proposed approach can achieve better performance compared to the baseline while removing the human from the loop.

Proceedings of the First Annual Conference on …, 1996

HiGP is a new high-performance genetic programming system. This system combines techniques from string-based genetic algorithms, Sexpression-based genetic programming systems, and high-performance parallel computing. The result is a fast, flexible, and easily portable genetic programming engine with a clear and efficient parallel implementation. HiGP manipulates and produces linear programs for a stack-based virtual machine, rather than the tree-structured Sexpressions used in traditional genetic programming. In this paper we describe the HiGP virtual machine and genetic programming algorithms. We demonstrate the system's performance on a symbolic regression problem and show that HiGP can solve this problem with substantially less computational effort than can a traditional genetic programming system. We also show that HiGP's time performance is significantly better than that of a well-written S-expression-based system, also written in C. We further show that our parallel version of HiGP achieves a speedup that is nearly linear in the number of processors, without mandating the use of localized breeding strategies.

1997

The extraction of features for classificationis often performed heuristically,despite the effect this stephas on the performance of the classifier.The Evolutionary Pre-Processoris presented, an automatic nonparametricmethod for the extractionof non-linear features. Usinggenetic programming, the EvolutionaryPre-Processor evolves networksof different non-linear functionswhich pre-process the data toimprove the discriminatory performanceof a classifier. In experimentsperformed on 9...

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2019

Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively rewriting them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

2005

Motivation: Classification problems are one of the major topics not only in computer science in general, but also especially in bioinformatics. Whereas many existing methods require additional information about the underlying system or user interaction, we here present a fully automatic, self-adaptive and problem instance independent data based classification tool based on Genetic Programming. Results: For testing the presented approach we have used two data sets, namely the Wisconsin Breast Cancer and the Melanoma data sets. The results achieved for these two problems instances are documented in this paper. Availability: The HeuristicLab, the optimization framework used for the research presented here, as well as an implementation of the Standard Genetic Algorithm are available from our website www.heuristiclab.com. The classification problem plug-in as well as more sophisticated genetic algorithms are still subject to ongoing research and therefore not yet fully published; the release of the first official versions is scheduled for the oncoming months. Contact:

Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery VIII, 2002

Feature extraction from imagery is an important and long-standing problem in remote sensing. In this paper, we report on work using genetic programming to perform feature extraction simultaneously from multispectral and digital elevation model (DEM) data. We use the GENetic Imagery Exploitation (GENIE) software for this purpose, which produces image-processing software that inherently combines spatial and spectral processing. GENIE is particularly useful in exploratory studies of imagery, such as one often does in combining data from multiple sources. The user trains the software by painting the feature of interest with a simple graphical user interface. GENIE then uses genetic programming techniques to produce an image-processing pipeline. Here, we demonstrate evolution of image processing algorithms that extract a range of land cover features including towns, wildfire burnscars, and forest. We use imagery from the DOE/NNSA Multispectral Thermal Imager (MTI) spacecraft, fused with USGS 1:24000 scale DEM data.

International Journal of Engineering Science and …, 2010

Genetic programming (GP) is a powerful evolutionary algorithm introduced to evolve computer programs automatically. It is a domain independent, stochastic method with an important ability to represent programs of arbitrary size and shape. Its flexible nature has attracted numerous researchers in data mining community to use GP for classification. In this paper we have reviewed and analyzed tree based GP classification methods and propose taxonomy of these methods. We have also discussed various strengths and weaknesses of the technique and provide a framework to optimize the task of GP based classification.

2010

Abstract. Genetic Programming is very efficient in problem solving compared to other proposals but its performance is very slow when the size of the data increases. This paper proposes a model for multi-threaded Genetic Programming classification evaluation using a NVIDIA CUDA GPUs programming model to parallelize the evaluation phase and reduce computational time. Three different well-known Genetic Programming classification algorithms are evaluated using the parallel evaluation model proposed.