By Topic

A Preliminary Study on Constructing Decision Tree with Gene Expression Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Weihong Wang ; Coll. of Software Eng., Zhejiang Univ. of Technol., Hangzhou ; Qu Li ; Shanshan Han ; Hai Lin

Gene expression programming (GEP) is a kind of genotype/phenotype based genetic algorithm. Its successful application in classification rules mining has gained wide interest in data mining and evolutionary computation fields. However, current GEP based classifiers represent classification rules in the form of expression tree, which is less meaningful and expressive than decision tree. What's more, these systems adopt one-against-all learning strategy, i.e. to solve a n-class with n runs, each run solving a binary classification task. In this paper, a GEP decision tree (GEPDT) system is presented, the system can construct a decision tree for classification without priori knowledge about the distribution of data, at the same time, GEPDT can solve a n-class problem in a single run, preliminary results show that the performance of GEP based decision tree is comparable to IDS

Published in:

Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on  (Volume:1 )

Date of Conference:

Aug. 30 2006-Sept. 1 2006