| ARTICLE |
|
| Year : 2012 | Volume
: 58
| Issue : 2 | Page : 138-154 |
|
|
ERANN: An Algorithm to Extract Symbolic Rules from Trained Artificial Neural Networks
SM Kamruzzaman1, Md. Abdul Hamid2, AM Jehad Sarkar3
1 Department of Electronics Engineering, Hankuk University of Foreign Studies, Yongin-si, Kyonggi-do, 449-791, Korea
2 Department of Information and Communications Engineering, Hankuk University of Foreign Studies, Yongin-si, Kyonggi-do, 449-791, Korea
3 Digital Information Engineering, Hankuk University of Foreign Studies, Yongin-si, Kyonggi-do, 449-791, Korea
Correspondence Address:
S M Kamruzzaman
Department of Electronics Engineering, Hankuk University of Foreign Studies, Yongin-si, Kyonggi-do, 449-791
Korea
 DOI: 10.4103/0377-2063.96181
|
|
|
This paper presents an algorithm to extract symbolic rules from trained artificial neural networks (ANNs), called ERANN. In many applications, it is desirable to extract knowledge from ANNs for the users to gain a better understanding of how the networks solve the problems. Although ANN usually achieves high classification accuracy, the obtained results sometimes may be incomprehensible, because the knowledge embedded within them is distributed over the activation functions and the connection weights. This problem can be solved by extracting rules from trained ANNs. To do so, a rule extraction algorithm has been proposed in this paper to extract symbolic rules from trained ANNs. A standard three-layer feedforward ANN with four-phase training is the basis of the proposed algorithm. Extensive experimental studies on a set of benchmark classification problems, including breast cancer, iris, diabetes, wine, season, golfplaying, and lenses classification, demonstrates the applicability of the proposed method. Extracted rules are comparable with other methods in terms of number of rules, average number of conditions for a rule, and the rules accuracy. The proposed method achieved accuracy values 96.28%, 98.67%, 76.56%, 91.01%, 100%, 100%, and 100% for the above problems, respectively. It has been seen that these results are one of the best results comparing with results obtained from related previous studies. |
|
|
|
| [FULL TEXT] [PDF]* |
|
 |
|
