Please use this identifier to cite or link to this item:
|Title:||Greedy rule generation from discrete data and its use in neural network rule extraction|
|Source:||Odajima, K.,Hayashi, Y.,Setiono, R. (2006). Greedy rule generation from discrete data and its use in neural network rule extraction. IEEE International Conference on Neural Networks - Conference Proceedings : 1833-1839. ScholarBank@NUS Repository.|
|Abstract:||This paper proposes GRG (Greedy Rule Generation) algorithm for generating classification rules from a data set with discrete attributes. The algorithm is "greedy" in the sense that at every iteration, it searches for the best rule to generate. The criteria for the best rule include the number of samples that it covers, the number of attributes involved in the rule, and the size of the input subspace it covers. This method is applied for extracting rules from neural networks that have been trained and pruned for solving classification problems. Neural networks with one hidden layer are trained and the proposed GRG algorithm is applied to their discretized hidden unit activation values. Our results show that rule extraction with the GRG method produces rule sets that are more accurate and concise compared to those obtained by a decision tree method and an existing neural network rule extraction method. © 2006 IEEE.|
|Source Title:||IEEE International Conference on Neural Networks - Conference Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.