loading...
Literal and ProRulext: Algorithms for Rule Extraction of ANNs
Rio de Janeiro, Brazil December 06-December 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICHIS.2005.69Fifth International Conference on Hyb ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Paulemir G. Campos, Center of Computer Science of the Federal University of Pernambuco, Brazil
Teresa B. Ludermir, Center of Computer Science of the Federal University of Pernambuco, Brazil
Artificial Neural Networks (ANN) presents excellent capacity for generalization. Besides, they are applied to the most diverse human knowledge domains. However, since they represent knowledge in its topology, weight values and bias, explaining clearly how an ANN has obtained its outputs is not a trivial task for human experts. Usually such deficiency can be minimized through the "IF/THEN" rule extraction from the trained network. Thus, this work presents two algorithms for the propositional rule extraction from trained ANNs: Literal and ProRulext. Among other advantages, these methods can be applied to trained networks for pattern classification and time series forecast, obtaining rules that are compact, comprehensible and faithful to the networks from which they have been extracted, also at a lower computational cost compared to NeuroLinear.
Citation:
Paulemir G. Campos, Teresa B. Ludermir, "Literal and ProRulext: Algorithms for Rule Extraction of ANNs," his, pp.143-148, Fifth International Conference on Hybrid Intelligent Systems (HIS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.