The University of Southampton
University of Southampton Institutional Repository

Recursive neural network rule extraction for data with mixed attributes

Recursive neural network rule extraction for data with mixed attributes
Recursive neural network rule extraction for data with mixed attributes
In this paper, we present a recursive algorithm for extracting classification rules from feedforward neural networks (NNs) that have been trained on data sets having both discrete and continuous attributes. The novelty of this algorithm lies in the conditions of the extracted rules: the rule conditions involving discrete attributes are disjoint from those involving continuous attributes. The algorithm starts by first generating rules with discrete attributes only to explain the classification process of the NN. If the accuracy of a rule with only discrete attributes is not satisfactory, the algorithm refines this rule by recursively generating more rules with discrete attributes not already present in the rule condition, or by generating a hyperplane involving only the continuous attributes. We show that for three real-life credit scoring data sets, the algorithm generates rules that are not only more accurate but also more comprehensible than those generated by other NN rule extraction methods.

299-307
Setiono, R.
afc2459a-ab0e-4716-baf9-75a5d20e7409
Baesens, B.
f7c6496b-aa7f-4026-8616-ca61d9e216f0
Mues, C.
07438e46-bad6-48ba-8f56-f945bc2ff934
Setiono, R.
afc2459a-ab0e-4716-baf9-75a5d20e7409
Baesens, B.
f7c6496b-aa7f-4026-8616-ca61d9e216f0
Mues, C.
07438e46-bad6-48ba-8f56-f945bc2ff934

Setiono, R., Baesens, B. and Mues, C. (2008) Recursive neural network rule extraction for data with mixed attributes. IEEE Transactions on Neural Networks, 19 (2), 299-307. (doi:10.1109/TNN.2007.908641).

Record type: Article

Abstract

In this paper, we present a recursive algorithm for extracting classification rules from feedforward neural networks (NNs) that have been trained on data sets having both discrete and continuous attributes. The novelty of this algorithm lies in the conditions of the extracted rules: the rule conditions involving discrete attributes are disjoint from those involving continuous attributes. The algorithm starts by first generating rules with discrete attributes only to explain the classification process of the NN. If the accuracy of a rule with only discrete attributes is not satisfactory, the algorithm refines this rule by recursively generating more rules with discrete attributes not already present in the rule condition, or by generating a hyperplane involving only the continuous attributes. We show that for three real-life credit scoring data sets, the algorithm generates rules that are not only more accurate but also more comprehensible than those generated by other NN rule extraction methods.

This record has no associated files available for download.

More information

Published date: February 2008

Identifiers

Local EPrints ID: 55804
URI: http://eprints.soton.ac.uk/id/eprint/55804
PURE UUID: c1a3d05d-b46c-46f7-8a4b-f7a8bfdc4bba
ORCID for B. Baesens: ORCID iD orcid.org/0000-0002-5831-5668
ORCID for C. Mues: ORCID iD orcid.org/0000-0002-6289-5490

Catalogue record

Date deposited: 06 Aug 2008
Last modified: 16 Mar 2024 03:40

Export record

Altmetrics

Contributors

Author: R. Setiono
Author: B. Baesens ORCID iD
Author: C. Mues ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×