共查询到20条相似文献,搜索用时 0 毫秒
1.
This paper proposes a method called layered genetic programming (LAGEP) to construct a classifier based on multi-population genetic programming (MGP). LAGEP employs layer architecture to arrange multiple populations. A layer is composed of a number of populations. The results of populations are discriminant functions. These functions transform the training set to construct a new training set. The successive layer uses the new training set to obtain better discriminant functions. Moreover, because the functions generated by each layer will be composed to a long discriminant function, which is the result of LAGEP, every layer can evolve with short individuals. For each population, we propose an adaptive mutation rate tuning method to increase the mutation rate based on fitness values and remaining generations. Several experiments are conducted with different settings of LAGEP and several real-world medical problems. Experiment results show that LAGEP achieves comparable accuracy to single population GP in much less time. 相似文献
2.
This paper proposed a new method for detecting islanding of distributed generation (DG), using Multi-gene Genetic Programming (MGP). Islanding has been a serious concern among power distribution utilities and distributed generation owners, because it poses risks to the safety of utilities’ workers and consumers, and can cause damage to power distribution systems’ equipment. Therefore, a DG must be disconnected as soon as an islanding is detected. In addition, an islanding detection method must have high degree of dependability to correctly discriminate islanding from other events, such as load switching, in order to avoid unnecessary disconnection of the distributed generator. In this context, the novelty of the proposed method is that the MGP is capable of obtaining a set of mathematical and logic functions employed to detect and classify islanding correctly. This is a new approach among the computational intelligent methods proposed for DG islanding detection. The main idea was to use local voltage measurements as input of the method, eliminating the need of complex and expensive communication infrastructure. The method has been trained with several islanding and non-islanding cases, by using a power distribution system comprising five concentrated loads, a synchronous distributed generator and a wind power plant. The results showed that the proposed method was successful in differentiating the islanding events from other disturbances, revealing its great potential to be applied in anti-islanding protection schemes for distributed generation. 相似文献
3.
Mu-Yen Chen Kuang-Ku Chen Heien-Kun Chiang Hwa-Shan Huang Mu-Jung Huang 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(12):1173-1183
As a broad subfield of artificial intelligence, machine learning is concerned with the development of algorithms and techniques
that allow computers to learn. These methods such as fuzzy logic, neural networks, support vector machines, decision trees
and Bayesian learning have been applied to learn meaningful rules; however, the only drawback of these methods is that it
often gets trapped into a local optimal. In contrast with machine learning methods, a genetic algorithm (GA) is guaranteeing
for acquiring better results based on its natural evolution and global searching. GA has given rise to two new fields of research
where global optimization is of crucial importance: genetic based machine learning (GBML) and genetic programming (GP). This
article adopts the GBML technique to provide a three-phase knowledge extraction methodology, which makes continues and instant
learning while integrates multiple rule sets into a centralized knowledge base. Moreover, the proposed system and GP are both
applied to the theoretical and empirical experiments. Results for both approaches are presented and compared. This paper makes
two important contributions: (1) it uses three criteria (accuracy, coverage, and fitness) to apply the knowledge extraction
process which is very effective in selecting an optimal set of rules from a large population; (2) the experiments prove that
the rule sets derived by the proposed approach are more accurate than GP. 相似文献
4.
Richard J. Preen Larry Bull 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2014,18(1):153-167
A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using discrete and fuzzy dynamical system representations within the XCSF learning classifier system. In particular, asynchronous random Boolean networks are used to represent the traditional condition-action production system rules in the discrete case and asynchronous fuzzy logic networks in the continuous-valued case. It is shown possible to use self-adaptive, open-ended evolution to design an ensemble of such dynamical systems within XCSF to solve a number of well-known test problems. 相似文献
5.
6.
7.
Estimation of classifier performance 总被引:1,自引:0,他引:1
Fukunaga K. Hayes R.R. 《IEEE transactions on pattern analysis and machine intelligence》1989,11(10):1087-1101
An expression for expected classifier performance previously derived by the authors (ibid., vol.11, no.8, p.873-855, Aug. 1989) is applied to a variety of error estimation methods and a unified and comprehensive approach to the analysis of classifier performance is presented. After the error expression is introduced, it is applied to three cases: (1) a given classifier and a finite test set; (2) given test distributions a finite design set; and (3) finite and independent design and test sets. For all cases, the expected values and variances of the classifier errors are presented. Although the study of Case 1 does not produce any new results, it is important to confirm that the proposed approach produces the known results, and also to show how these results are modified when the design set becomes finite, as in Cases 2 and 3. The error expression is used to compute the bias between the leave-one-out and resubstitution errors for quadratic classifiers. The effect of outliers in design samples on the classification error is discussed. Finally, the theoretical analysis of the bootstrap method is presented for quadratic classifiers 相似文献
8.
Durga Prasad Muni Nikhil R Pal Jyotirmoy Das 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2006,36(1):106-117
This paper presents an online feature selection algorithm using genetic programming (GP). The proposed GP methodology simultaneously selects a good subset of features and constructs a classifier using the selected features. For a c-class problem, it provides a classifier having c trees. In this context, we introduce two new crossover operations to suit the feature selection process. As a byproduct, our algorithm produces a feature ranking scheme. We tested our method on several data sets having dimensions varying from 4 to 7129. We compared the performance of our method with results available in the literature and found that the proposed method produces consistently good results. To demonstrate the robustness of the scheme, we studied its effectiveness on data sets with known (synthetically added) redundant/bad features. 相似文献
9.
Ubaldo M. García-PalomaresAuthor Vitae Orestes Manzanilla-SalazarAuthor Vitae 《Decision Support Systems》2012,52(3):717-728
This paper describes a novel approach to build a piecewise (non)linear surface that separates individuals from two classes with an a priori classification accuracy. In particular, total classification with a good generalization level can be obtained, provided no individual belongs to both classes. The method is iterative: at each iteration a new piece of the surface is found via the solution of a Linear Programming model. Theoretically, the larger the number of iterations, the better the classification accuracy in the training set; numerically, we also found that the generalization ability does not deteriorate on the cases tested. Nonetheless, we have included a procedure that computes a lower bound to the number of errors that will be generated in any given validation set. If needed, an early stopping criterion is provided. We also showed that each piece of the discriminating surface is equivalent to a neuron of a feed forward neural network (FFNN); so as a byproduct we are providing a novel training scheme for FFNNs that avoids the minimization of non convex functions which, in general, present many local minima.We compare this algorithm with a new linear SVM that needs no pre tuning and has an excellent performance on standard and synthetic data. Highly encouraging numerical results are reported on synthetic examples, on the Japanese Bank dataset, and on medium and small datasets from the Irvine repository of machine learning databases. 相似文献
10.
The genetic programming (GP) paradigm, which applies the Darwinian principle of evolution to hierarchical computer programs,
has been applied with breakthrough success in various scientific and engineering applications. However, one of the main drawbacks
of GP has been the often large amount of computational effort required to solve complex problems. Much disparate research
has been conducted over the past 25 years to devise innovative methods to improve the efficiency and performance of GP. This
paper attempts to provide a comprehensive overview of this work related to Canonical Genetic Programming based on parse trees
and originally championed by Koza (Genetic programming: on the programming of computers by means of natural selection. MIT,
Cambridge, 1992). Existing approaches that address various techniques for performance improvement are identified and discussed
with the aim to classify them into logical categories that may assist with advancing further research in this area. Finally,
possible future trends in this discipline and some of the open areas of research are also addressed. 相似文献
11.
Qiaolin Ye Chunxia Zhao Haofeng Zhang Ning Ye 《Expert systems with applications》2011,38(8):9425-9433
We first propose Distance Difference GEPSVM (DGEPSVM), a binary classifier that obtains two nonparallel planes by solving two standard eigenvalue problems. Compared with GEPSVM, this algorithm does not need to care about the singularity occurring in GEPSVM, but with better classification correctness. This formulation is capable of dealing with XOR problems with different distribution for keeping the genuine geometrical interpretation of primal GEPSVM. Moreover, the proposed algorithm gives classification correctness comparable to that of LSTSVM and TWSVM, but with lesser unknown parameters. Then, the regularization techniques are incorporated to the TWSVM. With the help of the regularized formulation, a linear programming formation for TWSVM is proposed, called FETSVM, to improve TWSVM sparsity, thereby suppressing input features. This means FETSVM is capable of reducing the number of input features, for linear case. When a nonlinear classifier is used, this means few kernel functions determine the classifier. Lastly, this algorithm is compared on artificial and public datasets. To further illustrate the effectiveness of our proposed algorithms, we also apply these algorithms to USPS handwritten digits. 相似文献
12.
A new method for design of a fuzzy-rule-based classifier using genetic algorithms (GAs) is discussed. The optimal parameters of the fuzzy classifier including fuzzy membership functions and the size and structure of fuzzy rules are extracted from the training data using GAs. This is done by introducing new representation schemes for fuzzy membership functions and fuzzy rules. An effectiveness measure for fuzzy rules is developed that allows for systematic addition or deletion of rules during the GA optimization process. A clustering method is utilized for generating new rules to be added when additions are required. The performance of the classifier is tested on two real-world databases (Iris and Wine) and a simulated Gaussian database. The results indicate that highly accurate classifiers could be designed with relatively few fuzzy rules. The performance is also compared to other fuzzy classifiers tested on the same databases. 相似文献
13.
Prediction of the natural gas consumption in chemical processing facilities with genetic programming
Cinkarna Ltd. is a chemical processing company in Slovenia and the country’s largest manufacturer of titanium oxides (TiO2). Chemical processing and titanium oxide manufacturing in particular requires high natural gas consumption, and it is difficult to accurately pre-order gas from suppliers. In accordance with the Energy Agency of the Republic of Slovenia regulations, each natural gas supplier regulates and determines the charges for the differences between the ordered (predicted) and the actually supplied quantities of natural gas. Yearly charges for these differences total 1.11 % of supplied natural gas costs (average 50,960 EUR per year). This paper presents natural gas consumption prediction and the minimization of associated costs. The data on daily temperature, steam boilers, sulfur acid and TiO2 production was collected from January 2012 until November 2014. Based on the collected data, a linear regression and a genetic programming model were developed. Compared to the specialist’s prediction of natural gas consumption, the linear regression and genetic programming models reduce the charges for the differences between the ordered and the actually supplied quantities by 3.00 and 5.30 times, respectively. Also, from January until November 2014 the same genetic programming model was used in practice. The results show that in a similar gas consumption regime the differences between the ordered and the actually supplied quantities are statistically significant, namely, they are 3.19 times lower (t test, p < 0.05) than in the period in which the specialist responsible for natural gas consumption made the predictions. 相似文献
14.
《Expert systems with applications》2014,41(10):4608-4616
Unified Parkinson’s Disease Rating Scale (UPDRS) assessment is the most used scale for tracking Parkinson’s disease symptom progression. Nowadays, the tracking process requires a patient to undergo invasive and time-consuming specialized examinations in hospital clinics, under the supervision of trained medical staff. Thus, the process is costly and logistically inconvenient for both patients and clinicians. For this reason, new powerful computational tools, aimed at making the process more automatic, cheaper and less invasive, are becoming more and more a necessity. The purpose of this paper is to investigate the use of an innovative intelligent system based on genetic programming for the prediction of UPDRS assessment, using only data derived from simple, self-administered and non-invasive speech tests. The system we propose is called geometric semantic genetic programming and it is based on recently defined geometric semantic genetic operators. Experimental results, achieved using the largest database of Parkinson’s disease speech in existence (approximately 6000 recordings from 42 Parkinson’s disease patients, recruited in a six-month, multi-centre trial), show the appropriateness of the proposed system for the prediction of UPDRS assessment. In particular, the results obtained with geometric semantic genetic programming are significantly better than the ones produced by standard genetic programming and other state of the art machine learning methods both on training and unseen test data. 相似文献
15.
Schema theory is the most well-known model of evolutionary algorithms. Imitating from genetic algorithms (GA), nearly all schemata defined for genetic programming (GP) refer to a set of points in the search space that share some syntactic characteristics. In GP, syntactically similar individuals do not necessarily have similar semantics. The instances of a syntactic schema do not behave similarly, hence the corresponding schema theory becomes unreliable. Therefore, these theories have been rarely used to improve the performance of GP. The main objective of this study is to propose a schema theory which could be a more realistic model for GP and could be potentially employed for improving GP in practice. To achieve this aim, the concept of semantic schema is introduced. This schema partitions the search space according to semantics of trees, regardless of their syntactic variety. We interpret the semantics of a tree in terms of the mutual information between its output and the target. The semantic schema is characterized by a set of semantic building blocks and their joint probability distribution. After introducing the semantic building blocks, an algorithm for finding them in a given population is presented. An extraction method that looks for the most significant schema of the population is provided. Moreover, an exact microscopic schema theorem is suggested that predicts the expected number of schema samples in the next generation. Experimental results demonstrate the capability of the proposed schema definition in representing the semantics of the schema instances. It is also revealed that the semantic schema theorem estimation is more realistic than previously defined schemata. 相似文献
16.
《Knowledge》2007,20(2):127-133
This paper proposes a new tree-generation algorithm for grammar-guided genetic programming that includes a parameter to control the maximum size of the trees to be generated. An important feature of this algorithm is that the initial populations generated are adequately distributed in terms of tree size and distribution within the search space. Consequently, genetic programming systems starting from the initial populations generated by the proposed method have a higher convergence speed. Two different problems have been chosen to carry out the experiments: a laboratory test involving searching for arithmetical equalities and the real-world task of breast cancer prognosis. In both problems, comparisons have been made to another five important initialization methods. 相似文献
17.
It is quite difficult but essential for Genetic Programming (GP) to evolve the choice structures. Traditional approaches usually ignore this issue. They define some “if-structures” functions according to their problems by combining “if-else” statement, conditional criterions and elemental functions together. Obviously, these if-structure functions depend on the specific problems and thus have much low reusability. Based on this limitation of GP, in this paper we propose a kind of termination criterion in the GP process named “Combination Termination Criterion” (CTC). By testing CTC, the choice structures composed of some basic functions independent to the problems can be evolved successfully. Theoretical analysis and experiment results show that our method can evolve the programs with choice structures effectively within an acceptable additional time. 相似文献
18.
Darren M. Chitty 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2016,20(2):661-680
Genetic Programming (GP) (Koza, Genetic programming, MIT Press, Cambridge, 1992) is well-known as a computationally intensive technique. Subsequently, faster parallel versions have been implemented that harness the highly parallel hardware provided by graphics cards enabling significant gains in the performance of GP to be achieved. However, extracting the maximum performance from a graphics card for the purposes of GP is difficult. A key reason for this is that in addition to the processor resources, the fast on-chip memory of graphics cards needs to be fully exploited. Techniques will be presented that will improve the performance of a graphics card implementation of tree-based GP by better exploiting this faster memory. It will be demonstrated that both L1 cache and shared memory need to be considered for extracting the maximum performance. Better GP program representation and use of the register file is also explored to further boost performance. Using an NVidia Kepler 670GTX GPU, a maximum performance of 36 billion Genetic Programming Operations per Second is demonstrated. 相似文献
19.