Classification is a data mining method that assigns items in a collection to target classes with the goal to accurately predict the target class for each item in the data. geneticprogramming (GP) is one of the effect...
详细信息
ISBN:
(纸本)9781467347686
Classification is a data mining method that assigns items in a collection to target classes with the goal to accurately predict the target class for each item in the data. geneticprogramming (GP) is one of the effective evolutionary computation techniques to solve classification problems, however, it suffers from a long run time. In addition, there are many parameters that need to be set before the GP is run. In this paper, we propose an adaptive GP that automatically determines the best parameters of a run, and executes the classification faster than standard GP. This adaptive GP has three variations. The first variant consists of an adaptive selection process ensuring that the produced solutions in the next generation are better than the solutions in the previous generation. The second variant adapts the crossover and mutation rates by modifying the probabilities ensuring that a solution with a high fitness is protected. And the third variant is an adaptive function list that automatically changes the functions used by deleting the functions that do not favorably contribute to the classification. These proposed variations were implemented and compared to the standard GP. The results show that a significant speedup can be achieved by obtaining similar classification accuracies.
We propose in this paper a modification of one of the modern state-of-the-art geneticprogramming algorithms used for data-driven modeling, namely the Bi-objective geneticprogramming (BioGP). The original method is b...
详细信息
ISBN:
(纸本)9783319422978;9783319422961
We propose in this paper a modification of one of the modern state-of-the-art geneticprogramming algorithms used for data-driven modeling, namely the Bi-objective geneticprogramming (BioGP). The original method is based on a concurrent minimization of both the training error and complexity of multiple candidate models encoded as geneticprogramming trees. Also, BioGP is empowered by a predator-prey co-evolutionary model where virtual predators are used to suppress solutions (preys) characterized by a poor trade-off error vs complexity. In this work, we incorporate in the original BioGP an adaptive mechanism that automatically tunes the mutation rate, based on a characterization of the current population (in terms of entropy) and on the information that can be extracted from it. We show through numerical experiments on two different datasets from the energy domain that the proposed method, named BioAGP (where "A" stands for "adaptive"), performs better than the original BioGP, allowing the search to maintain a good diversity level in the population, without affecting the convergence rate.
暂无评论