Skip to main content

Computationally Efficient Heuristics for If-Then Rule Extraction from Feed-Forward Neural Networks

  • Conference paper
  • First Online:
Book cover Discovery Science (DS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1967))

Included in the following conference series:

Abstract

In this paper, we address computational complexity issues of decompositional approaches to if-then rule extraction from feed-forward neural networks. We also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, Robert, Diederich, Joachim, Tickle, Alam B.: Survey and critique of techniques for extracting rules from trained artificial neural networks. Knowledge-Based Systems 8(6) (1995) 373–389

    Article  Google Scholar 

  2. Fu, LiMin.: Knowledge-based connectionism for revising domain theories. IEEE Transactions on Systems, Man, and Cybernetics 23(1) (1993) 173–182

    Article  Google Scholar 

  3. Fu, LiMin.: Neural Networks in Computer Intelligence. McGraw Hill, Inc., (1994)

    Google Scholar 

  4. Fu, LiMin.: Rule generation from neural networks. IEEE Transactions on Systems, Man, and Cybernetics 24(8) (1994) 1114–1124

    Article  Google Scholar 

  5. Fu, LiMin, Kim, Hyeoncheol.: Abstraction and Representation of Hidden Knowl-edge in an Adapted Neural Network. unpublished, CISE, University of Florida (1994)

    Google Scholar 

  6. Gallant, S.I.: Connectionist expert systems. Communications of the ACM 31(2) (1988) 152–169

    Article  Google Scholar 

  7. Taha, Ismali A., Ghosh, Joydeep: Symbolic interpretation of artificial neural net-works. IEEE Transactions on Knowledge and Data Engineering 11(3) (1999) 443–463

    Article  Google Scholar 

  8. Setino, Rudy, Liu, Huan: Understanding neural networks via rule extraction. Pro-ceedings of the 14th International Conference on Neural Networks. (1) Montreal, Canada (1995) 480–485

    Google Scholar 

  9. Towell, Geoffrey G., Shavlik, Jude W.: Extracting refined rules from knowledge-based neural networks. Machine Learning 13(1) (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, H. (2000). Computationally Efficient Heuristics for If-Then Rule Extraction from Feed-Forward Neural Networks. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44418-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41352-3

  • Online ISBN: 978-3-540-44418-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics