17721223
Parallel evolutionary algorithms on graphics processing unit
Evolutionary algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuit synthesis, and data mining. However, they may execute for a long time for some difficult problems, because several fitness evaluations must be performed. A promising approach to overcome this limitation is to parallelize these algorithms. In this paper, we propose to implement a parallel EA on consumer-level graphics cards. We perform experiments to compare our parallel EA with an ordinary EA and demonstrate that the former is much more effective than the latter. Since consumer-level graphics cards are available in ubiquitous personal computers and these computers are easy to use and manage, more people are able to use our parallel algorithm to solve their problems encountered in real-world applications.
2011139
Discovering knowledge from noisy databases using genetic programming
In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). To handle noise in the problem domain, existing learning systems avoid overfitting the imperfect training examples by excluding insignificant patterns. The problem is that these systems use a limiting attribute-value language for representing the training examples and the induced knowledge. Moreover, some important patterns are ignored because they are statistically insignificant. In this paper, we present a framework that combines Genetic Programming (Koza 1992; 1994) and Inductive Logic Programming (Muggleton, 1992) to induce knowledge represented in various knowledge representation formalisms from noisy databases. The framework is based on a formalism of logic grammars and it can specify the search space declaratively. An implementation of the framework, LOGENPRO (The Logic grammar based GENetic PROgramming system), has been developed. The performance of LOGENPRO is evaluated on the chess endgame domain. We compare LOGENPRO with FOIL and other learning systems in detail and find its performance is significantly better than that of the others. This result indicates that the Darwinian principle of natural selection is a plausible noise handling method which can avoid overfitting and identify important patterns at the same time. Moreover, the system is applied to one real-life medical database. The knowledge discovered provides insights to and allows better understanding of the medical domains. Area: Data mining, Genetic Programming, Evolutionary Computation, Rule Learning
14473564
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to parse trees. Hence, GP should be able to handle them as well. In practice, the syntax of Lisp is so simple and uniform that the translation process can be achieved easily, programs evolved by GP are usually expressed in Lisp. This paper presents a flexible framework that programs in various programming languages can be acquired. This framework is based on a formalism of logic grammars. To implement the framework, a system called LOGENPRO (The LOgic grammar based GENetic PROgramming system) has been developed. An experiment that employs LOGENPRO to induce a S-expression for calculating dot product has been performed. This experiment illustrates that LOGENPRO, when used with knowledge of data types, accelerates the learning of programs. Other experiments have been done to illustrate the ability of LOGENPRO in inducing programs in difference programming languages including Prolog and C. These experiments prove that LOGENPRO is very flexible.
18850432
A hybrid approach to discover Bayesian networks from databases using evolutionary programming
Describes a data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches to the network learning problem. The first one uses dependency analysis, while the second one searches good network structures according to a metric. Unfortunately, both approaches have their own drawbacks. Thus, we propose a hybrid algorithm of the two approaches, which consists of two phases, namely, the conditional independence test and the search phases. A new operator is introduced to further enhance the search efficiency. We conduct a number of experiments and compare the hybrid algorithm with our previous algorithm, MDLEP, which uses EP for network learning. The empirical results illustrate that the new approach has better performance. We apply the approach to data sets of direct marketing and compare the performance of the evolved Bayesian networks obtained by the new algorithm with the models generated by other methods. In the comparison, the induced Bayesian networks produced by the new algorithm outperform the other models.
10417746
An Adaptive Inductive Logic Programming System Using Genetic Programming
Recently, there has been increasing interest in systems that induce firstorder logic programs. In this formalism, domain knowledge represented in the forms of first-order relations can be used in the induced programs. The task of inducing a logic program can be formulated as a search problem (Mitchell 1982) in a hypotheses space of logic programs. Various approaches (Quinlan 1990; Muggleton and Feng 1990) differ mainly in the search strategy and the heuristics used to guide the search. The search Abstract
15319623
Inducing Logic Programs With Genetic Algorithms: The Genetic Logic Programming System
The Genetic Logic Programming System (GLPS) combines the learning power of genetic algorithms and the knowledge representation power of logic programming to overcome the shortcomings of existing paradigms. >
29409552
Automatic digital modulation recognition using artificial neural network and genetic algorithm
Automatic recognition of digital modulation signals has seen increasing demand nowadays. The use of artificial neural networks for this purpose has been popular since the late 1990s. Here, we include a variety of modulation types for recognition, e.g. QAM16, V29, V32, QAM64 through the addition of a newly proposed statistical feature set. Two training algorithms for multi-layer perceptron (MLP) recogniser, namely Backpropagation with Momentum and Adaptive Learning Rate is investigated, while resilient backpropagation (RPROP) is proposed for this problem, are employed in this work. In particular, the RPROP algorithm is applied for the first time in this area. In conjunction with these algorithms, we use a separate data set as validation set during training cycle to improve generalisation. Genetic algorithm (GA) based feature selection is used to select the best feature subset from the combined statistical and spectral feature set. RPROP MLP recogniser achieves about 99% recognition performance on most SNR values with only six features selected using GA.
9973907
Blind Phase-Amplitude Modulation Classification with Unknown Phase Offset
This paper first discusses the maximum likelihood (ML) classifier for automatic classification of digital modulations. The classifier is optimum for classification of phase-amplitude modulated signals under ideal environment. However, this is not the case in the presence of phase offset owing to inaccurate estimation. In this paper, we propose a novel non-coherent ML classifier to mitigate the effect phase offset. The non-coherent ML classifier adopts a pre-classification phase correction stage through a closed form estimator based on higher order statistics. Experimental results show improvement of classification accuracy at reasonable signal to noise ratio