Skip to main content
Kent Academic Repository

A genetic algorithm for discovering small disjunct rules in data mining

Carvalho, Deborah R., Freitas, Alex A. (2002) A genetic algorithm for discovering small disjunct rules in data mining. Applied Soft Computing, 2 (2). pp. 75-88. ISSN 1568-4946. (doi:10.1016/S1568-4946(02)00031-5) (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:13691)

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.
Official URL:
http://dx.doi.org/10.1016/S1568-4946(02)00031-5

Abstract

This paper addresses the well-known classification task of data mining, where the goal is to discover rules predicting the class of examples (records of a given dataset). In the context of data mining, small disjuncts are rules covering a small number of examples. Hence, these rules are usually error-prone, which contributes to a decrease in predictive accuracy. At first glance, this is not a serious problem, since the impact on predictive accuracy should be small. However, although each small-disjunct covers few examples, the set of all small disjuncts can cover a large number of examples. This paper presents evidence that this is the case in several datasets. This paper also addresses the problem of small disjuncts by using a hybrid decision-tree/genetic-algorithm approach. In essence, 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 specifically designed for discovering small-disjunct rules. We present results comparing the predictive accuracy of this hybrid system with the prediction accuracy of three versions of C4.5 alone in eight public domain datasets. Overall, the results show that our hybrid system achieves better predictive accuracy than all three versions of C4.5 alone.

Item Type: Article
DOI/Identification number: 10.1016/S1568-4946(02)00031-5
Uncontrolled keywords: data mining, evolutionary algorithms, classification
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 17:59 UTC
Last Modified: 05 Nov 2024 09:47 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13691 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.