Generating classification trees for small disjuncts using incremental gas

ABSTRACT

In this paper an Incremental GA techniques is proposed tosolve the problem of small disjuncts in classification trees. It is once applied on the disjuncts sorted in ascending orderand once in descending order with respect to their coverage. Both versions of the technique have been tested using benchmark datasets and the results are compared with thoseof other hybrid techniques.

REFERENCES

• 1: J. Ross Quinlan, C4.5: programs for machine learning, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1993
• 2: Deborah R. Carvalho and Alex A. Freitas "A Hybrid Decision Tree/Genetic Algorithm Method for Data Mining", 2003.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS

Additional Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods

General Terms:
Algorithms

Keywords:
incremental genetic algorithms, small disjuncts