Top-down induction of reduced ordered decision diagrams from neural networks

Authors:
Jan Chorowski;Jacek M. Zurada
Affiliations:
University of Louisville, Louisville, KY;University of Louisville, Louisville, KY
Venue:
ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
Year:
2011

Citing 12
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
C4.5: programs for machine learning

C4.5: programs for machine learning
Bottom-up induction of oblivious read-once decision graphs: strengths and limitations

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Symbolic Representation of Neural Networks

Computer - Special issue: neural computing: companion issue to Spring 1996 IEEE Computational Science & Engineering
Using the minimum description length principle to infer reduced ordered decision graphs

Machine Learning
A search technique for rule extraction from trained neural networks

Non-Linear Analysis
Algorithms and Data Structures in VLSI Design

Algorithms and Data Structures in VLSI Design
Oblivious decision trees graphs and top down pruning

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The WEKA data mining software: an update

ACM SIGKDD Explorations Newsletter
Orthogonal search-based rule extraction (OSRE) for trained neural networks: a practical and efficient approach

IEEE Transactions on Neural Networks
Recursive Neural Network Rule Extraction for Data With Mixed Attributes

IEEE Transactions on Neural Networks
Extracting Rules From Neural Networks as Decision Diagrams

IEEE Transactions on Neural Networks - Part 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neural networks offer good generalization performance, noise robustness, and model complexity control. However, neural network mappings are expressed in terms of complicated mathematical functions that are inherently hard to understand. To overcome this limitation rule extraction methods have been proposed. This paper presents a novel method of rule extraction which recursively, in a top-down manner, builds a Reduced Ordered Decision Diagram. The diagram structure allows sharing of nodes, which partially overcomes two problems present in Decision Tree-based rule extraction - the problem of subtree replication and of training set fragmentation. A method for reducing the rule search space by identifying regions in which the network shows similar behavior is presented. Preliminary results of the method performance are reported.