Results 1 
7 of
7
Genetic Programming
, 1997
"... Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract

Cited by 1056 (12 self)
 Add to MetaCart
Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring genetic operations such as crossover (sexual recombination) and mutation. John Holland's pioneering Adaptation in Natural and Artificial Systems (1975) described how an analog of the evolutionary process can be applied to solving mathematical problems and engineering optimization problems using what is now called the genetic algorithm (GA). The genetic algorithm attempts to find a good (or best) solution to the problem by genetically breeding a population of individuals over a series of generations. In the genetic algorithm, each individual in the population represents a candidate solut
Pixel Classification Using Variable String Genetic Algorithms with Chromosome Differentiation
"... Abstract—The concept of chromosome differentiation, commonly witnessed in nature as male and female sexes, is incorporated in genetic algorithms with variable length strings for designing a nonparametric classification methodology. Its significance in partitioning different landcover regions from sa ..."
Abstract
 Add to MetaCart
Abstract—The concept of chromosome differentiation, commonly witnessed in nature as male and female sexes, is incorporated in genetic algorithms with variable length strings for designing a nonparametric classification methodology. Its significance in partitioning different landcover regions from satellite images, having complex/overlapping class boundaries, is demonstrated. The classifier is able to evolve automatically the appropriate number of hyperplanes efficiently for modeling any kind of class boundaries optimally. Merits of the system over the related ones are established through the use of several quantitative measure. Index Terms—Genetic algorithms, hyperplane fitting, pattern recognition, quantitative indices, remote sensing images. I.
Maximizing Sets and Fuzzy Markoff Algorithms
"... Abstract—A fuzzy algorithm is an ordered set of fuzzy instructions that upon execution yield an approximate solution to a given problem. Two unrelated aspects of fuzzy algorithms are considered in this paper. The first is concerned with the problem of maximization of a reward function. It is argued ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—A fuzzy algorithm is an ordered set of fuzzy instructions that upon execution yield an approximate solution to a given problem. Two unrelated aspects of fuzzy algorithms are considered in this paper. The first is concerned with the problem of maximization of a reward function. It is argued that the conventional notion of a maximizing value for a function is not sufficiently informative and that a more useful notion is that of a maximizing set. Essentially, a maximizing set serves to provide information not only concerning the point or points at which a function is maximized, but also about the extent to which the values of the reward function approximate to its supremum at other points in its range. The second is concerned with the formalization of the notion of a fuzzy algorithm. In this connection, the notion of a fuzzy
Correspondence Technique for Fractal Image Compression Using Genetic Algorithm
"... Abstract — A new method for fractal image compression is proposed using genetic algorithm (GA) with elitist model. The self transformability property of images is assumed and exploited in the fractal image compression technique. The technique described here utilizes the GA, which greatly decreases t ..."
Abstract
 Add to MetaCart
Abstract — A new method for fractal image compression is proposed using genetic algorithm (GA) with elitist model. The self transformability property of images is assumed and exploited in the fractal image compression technique. The technique described here utilizes the GA, which greatly decreases the search space for finding the self similarities in the given image. This correspondence presents theory, implementation, and analytical study of the proposed method along with a simple classification scheme. Comparison with other fractalbased image compression methods has also been reported here. Index Terms—Compression ratio, genetic algorithm (GA), image compression, isometry, iterated function system (IFS). I.
PLEASE SCROLL DOWN FOR ARTICLE
, 2014
"... Publication details, including instructions for authors and subscription information: ..."
Abstract
 Add to MetaCart
(Show Context)
Publication details, including instructions for authors and subscription information:
VGAClassifier: Design and Applications
"... Abstract—A method for pattern classification using genetic algorithms (GAs) has been recently described in [1], where the class boundaries of a data set are approximated by a fixed number of hyperplanes. As a consequence of fixing a priori, the classifier suffered from the limitation of overfitting ..."
Abstract
 Add to MetaCart
Abstract—A method for pattern classification using genetic algorithms (GAs) has been recently described in [1], where the class boundaries of a data set are approximated by a fixed number of hyperplanes. As a consequence of fixing a priori, the classifier suffered from the limitation of overfitting (or underfitting) the training data with an associated loss of its generalization capability. In this paper, we propose a scheme for evolving the value of automatically using the concept of variable length strings/chromosomes. The crossover and mutation operators are newly defined in order to handle variable string lengths. The fitness function ensures primarily the minimization of the number of misclassified samples, and also the reduction of the number of hyperplanes. Based on an analogy between the classification principles of the genetic classifier and multilayer perceptron (with hard limiting neurons), a method for automatically determining the architecture and the connection weights of the latter is described. Index Terms—Genetic algorithms, multilayer perceptron, pattern recognition, variable length chromosomes. I.