Extracting rules from feedforward Boolean neural networks

Proceedings - Brazilian Symposium on Neural Networks, SBRN

Volumn , Issue , 1998, Pages 61-66

  Ludermir, Teresa B ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERT SYSTEMS; EXTRACTION;

BOOLEAN NEURAL NETWORKS; EXTRACTING RULES; FEED-FORWARD; RULE EXTRACTION; RULE EXTRACTION FROM NEURAL NETWORKS;

FEEDFORWARD NEURAL NETWORKS;

EID: 85049501264     PISSN: 15224899     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBRN.1998.730995     Document Type: Conference Paper

References (21)

1. I. Aleksander. The logic of connectionist systems. In R. Eckmiller and C. Malsburg, editors, Neural Computers, pages 189-197. Springer-Verlag, Berlin, 1988
2. R. Andrews, J. Diederich, and A. Tickle. A survey and critique of techniques for extracting rules from trained artificial neural networks. Knowledge Based Systems, pages http:fit.qut.edu.au//pub/NRC/ps/QUTNRC-95-01-02.ps.Z, 1995
3. R. Andrews and G. Geva. Inserting and extracting knowledge from constraneid error backpropagation networks. Proc. 5th Australian Conference on Neural Networks, 1995
4. J. A. Barnden and J. B. Pollack. High-Level Connectionist Models, volume 1 of Advances in Connectionist and Neural Computation Theory. Ablex Publishing Corporation, Norwood, New Jersey, 1991
5. R. Beale and T. Jackson. Neural Computing: An Introduction. Adam Hilger, Bristol, 1991
6. R. Blasig. Gds: Gradient descent generation of symbolic classification rules. Advances in Neural Information Processing systems, 6, 1994
7. M. Craven and J. Shavlik. Learning symbolic rules using artificial neural networks. In Proceeding of the Tenth International Conference on Machine Learning, pages 73-80, 1993
8. M. Craven and J. Shavlik. Using sampling and queries to extract rules from trained neural networks. In Proceedings of the Eleventh International Conference of Machine Learning, pages 152-169, Sao Francisco, 1994
9. M. W. Craven. Extracting comprehensible models from trained neural networks. PhD thesis, 1996
10. E. Filho, D. Bisset, and M. Fairhurst. Architectures for goal-seeking neurons. Journal of Intelligent Systems, 2:95-120, 1992
11. L. Fu. Rule learning by searching on adapted nets. In Proceeding of the Ninth National Conference on Artificial Intelligence, pages 590-595, 1991
12. J. Hong and X. Tan. The similarity between connectionist and other parallel computation models. Chapter 13 of [4]
13. T. B. Ludermir. Computability of logical neural networks. Journal of Intelligent Systems, 2:261-290, 1992
14. T. B. Ludermir and W. R. Oliveira. Weightless neural models. Computer Standards &Interfaces, 16:253-263, 1994
15. C. McMillan, M. Mozer, and P. Smolensky. Rule in-dution through integrated symbolic and subsymbolic processing. Advances in Neural Information Processing Systems, 4, 1992
16. C. E. Myers. Output functions for probabilistic logic nodes. In Proceedings First IEE International Conference on Artificial Neural Networks-Proc. number 313., pages 310-314, 1989
17. A. Salomaa. Probabilistics and weighted grammars. Information and Control, 15:529-44, 1969
18. R. Setiono and H. Liu. Understanding neural networks via rule extraction. In Proceeding of the Fourteenth International Joint Conference on Artificial Intelligence, 1995
19. M. Souto, T. B. Ludermir, and W. R. Oliveira. Synthesis of probabilistic automata in pram neural networks. In Proceedings of ICANN-98, Suiga, 1998
20. S. Thrun. The monk's problems a performance comparison of different learning algorithms. Cmu-cs-91-197, Carnegie Mellon University, USA, 1991
21. G. Towell. Extracting refined rules from knowledge-based neural networks. Machine Learning, 131:71-101, 1993