A Memetic Genetic Programming with decision tree-based local search for classification problems

Pu WANG, Ke TANG, Edward P. K. TSANG, Xin YAO

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

23 Citations (Scopus)

Abstract

In this work, we propose a new genetic programming algorithm with local search strategies, named Memetic Genetic Programming(MGP), for classification problems. MGP aims to acquire a classifier with large Area Under the ROC Curve (AUC), which has been proved to be a better performance metric for traditionally used metrics (e.g., classification accuracy). Three new points are presented in our new algorithm. First, a new representation called statistical genetic decision tree (SGDT) for GP is proposed on the basis of Genetic Decision Tree (GDT). Second, a new fitness function is designed by using statistic information from SGDT. Third, the concept of memetic computing is introduced into SGDT. As a result, the MGP is equipped with a local search method based on the training algorithms for decision trees. The efficacy of the MGP is empirically justified against a number of relevant approaches. © 2011 IEEE.
Original languageEnglish
Title of host publication2011 IEEE Congress of Evolutionary Computation, CEC 2011
Pages917-924
Number of pages8
DOIs
Publication statusPublished - Jun 2011
Externally publishedYes

Keywords

  • AUC
  • Classification
  • Genetic Programming
  • Memetic Algorithm

Fingerprint

Dive into the research topics of 'A Memetic Genetic Programming with decision tree-based local search for classification problems'. Together they form a unique fingerprint.

Cite this