Learning Symbolic Rules Using Artificial Neural Networks (1993)
| Venue: | Proceedings of the Tenth International Conference on Machine Learning |
| Citations: | 40 - 6 self |
BibTeX
@INPROCEEDINGS{Craven93learningsymbolic,
author = {Mark W. Craven and Jude W. Shavlik},
title = {Learning Symbolic Rules Using Artificial Neural Networks},
booktitle = {Proceedings of the Tenth International Conference on Machine Learning},
year = {1993},
pages = {73--80},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A distinct advantage of symbolic learning algorithms over artificial neural networks is that typically the concept representations they form are more easily understood by humans. One approach to understanding the representations formed by neural networks is to extract symbolic rules from trained networks. In this paper we describe and investigate an approach for extracting rules from networks that uses (1) the NofM extraction algorithm, and (2) the network training method of soft weight-sharing. Previously, the NofM algorithm had been successfully applied only to knowledge-based neural networks. Our experiments demonstrate that our extracted rules generalize better than rules learned using the C4.5 system. In addition to being accurate, our extracted rules are also reasonably comprehensible. 1 INTRODUCTION Artificial neural networks (ANNs) have been successfully applied to real-world problems as varied as steering a motor vehicle (Pomerleau, 1991) and learning to pronounce English tex...
