DocumentCode :
2702495
Title :
Rule extraction from linear combinations of DIMLP neural networks
Author :
Bologna, Guido
Author_Institution :
Sch. of Comput., Nat. Univ. of Singapore, Singapore
fYear :
2000
fDate :
2000
Firstpage :
95
Lastpage :
100
Abstract :
The problem of rule extraction from neural networks is NP-hard. This work presents a new technique to extract If-Then-Else rules from linear combinations of discretised interpretable multilayer perceptron (DIMLP) neural networks. Rules are extracted in polynomial time with respect to the dimensionality of the problem, the number of examples, and the size of the resulting network. Further, the degree of matching between extracted rules and neural network responses is 100%. Linear combinations of DIMLP networks were trained on 4 data sets related to the public domain. The extracted rules obtained are more accurate than those extracted from C4.5 decision trees on average
Keywords :
computational complexity; knowledge acquisition; learning (artificial intelligence); multilayer perceptrons; NP-hard problem; discretised interpretable multilayer perceptron; learning; neural networks; polynomial time; rule extraction; Artificial neural networks; Computational complexity; Computer networks; Data mining; Decision trees; NP-hard problem; Neural networks; Neurons; Polynomials; Taxonomy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2000. Proceedings. Sixth Brazilian Symposium on
Conference_Location :
Rio de Janeiro, RJ
ISSN :
1522-4899
Print_ISBN :
0-7695-0856-1
Type :
conf
DOI :
10.1109/SBRN.2000.889720
Filename :
889720
Link To Document :
بازگشت