Greedy rule generation from discrete data and its use in neural network rule extraction.
This paper proposes a GRG (Greedy Rule Generation) algorithm, a new method 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 and the size of subspaces that it covers, as well as the number of attributes in the rule. This method is employed for extracting rules from neural networks that have been trained and pruned for solving classification problems. The classification rules are extracted from the neural networks using the standard decompositional approach. Neural networks with one hidden layer are trained and the proposed GRG algorithm is applied to their discretized hidden unit activation values. Our experimental results show that neural network rule extraction with the GRG method produces rule sets that are accurate and concise. Application of GRG directly on three medical data sets with discrete attributes also demonstrates its effectiveness for rule generation.
Odajima
Koichi
K
Department of Computer Science, Meiji University, Tama-ku, Kawasaki 214-8571, Japan.
Hayashi
Yoichi
Y
Tianxia
Gong
G
Setiono
Rudy
R
D000465:Algorithms; D001185:Artificial Intelligence; D003627:Data Interpretation, Statistical; D035264:Flowers / Q000145:classification; D006801:Humans; D009369:Neoplasms / Q000145:classification; D016571:Neural Networks, Computer; D015203:Reproducibility of Results; D012984:Software