Skip to main content

A genetic algorithm with sequential niching for discovering small-disjunct rules

Carvalho, Deborah R. and Freitas, Alex A. (2002) A genetic algorithm with sequential niching for discovering small-disjunct rules. In: Langdon, William B. and Cantu-Paz, Erick, eds. Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann, San Francisco, California, USA, pp. 1035-1042. ISBN 1-55860-878-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13768)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)

Abstract

This work addresses the well-known classification task of data mining. In this context, small disjuncts are classification rules covering a small number of examples. One approach for coping with small disjuncts, proposed in our previous work, consists of using a decision-tree/genetic algorithm method. The basic idea is that examples belonging to large disjuncts are classified by rules produced by a decision-tree algorithm (C4.5), while examples belonging to small disjuncts are classified by a genetic algorithm (GA) designed for discovering small-disjunct rules. In this paper we follow this basic idea, but we propose a new GA which consists of several major modifications to the original GA used for coping with small disjuncts. The performance of the new GA is extensively evaluated by comparing it with two versions of C4.5, across several data sets, and with several different sizes of small disjuncts.

Item Type: Book section
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:00 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13768 (The current URI for this page, for reference purposes)
Freitas, Alex A.: https://orcid.org/0000-0001-9825-4700
  • Depositors only (login required):