pith. sign in

arxiv: 1009.4984 · v1 · pith:DGAJJ7J7new · submitted 2010-09-25 · 💻 cs.NE

Rule Extraction using Artificial Neural Networks

classification 💻 cs.NE
keywords networksneuralalgorithmnetworkartificialextractnodesnumber
0
0 comments X
read the original abstract

Artificial neural networks have been successfully applied to a variety of business application problems involving classification and regression. Although backpropagation neural networks generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions are not as interpretable as those of decision trees. In many applications, it is desirable to extract knowledge from trained neural networks so that the users can gain a better understanding of the solution. This paper presents an efficient algorithm to extract rules from artificial neural networks. We use two-phase training algorithm for backpropagation learning. In the first phase, the number of hidden nodes of the network is determined automatically in a constructive fashion by adding nodes one after another based on the performance of the network on training data. In the second phase, the number of relevant input units of the network is determined using pruning algorithm. The pruning process attempts to eliminate as many connections as possible from the network. Relevant and irrelevant attributes of the data are distinguished during the training process. Those that are relevant will be kept and others will be automatically discarded. From the simplified networks having small number of connections and nodes we may easily able to extract symbolic rules using the proposed algorithm. Extensive experimental results on several benchmarks problems in neural networks demonstrate the effectiveness of the proposed approach with good generalization ability.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Rule Extraction in Machine Learning: Chat Incremental Pattern Constructor

    cs.LG 2022-07 unverdicted novelty 4.0

    ChatIPC extracts ordered token-transition rules from text via incremental learning and definition expansion, then constructs responses through similarity-guided selection on a token graph.