Loading...
Please wait, while we are loading the content...
Similar Documents
Extraction of Crisp Logical Rules Using Constrained Backpropagation Networks (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Adamczak, Rafal Grabczewski, Krzysztof Duch, Wlodzislaw |
| Abstract | The problem of extraction of crisp logical rules from neural networks trained with backpropagation algorithm is solved by transforming these networks into simpler networks performing logical functions. Two constraints are included in the cost function: regularization term inducing weight decay and additional term forcing the remaining weights to \Sigma1. Networks with minimal number of connections are created, leading to a small number of crisp logical rules. A constructive algorithm is proposed, in which rules are generated consecutively by adding more nodes to the network. Rules that are most general, covering many training examples, are created first, followed by more specific rules, covering a few cases only. Generation of new rules is stopped when their application on the test dataset does not increase the number of correctly classified cases. Our constructive algorithm applied to the Iris classification problem generates two rules with three antecedents giving 98.7% accuracy. A s... |
| File Format | |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Additional Term Test Dataset Regularization Term Iris Classification Problem Constructive Algorithm Simpler Network Weight Decay Logical Function Crisp Logical Rule Many Training Example Backpropagation Algorithm Specific Rule |
| Content Type | Text |
