Extracting boolean and probabilistic rules from trained neural networks.

Journal: Neural networks : the official journal of the International Neural Network Society
Published Date:

Abstract

This paper presents two approaches to extracting rules from a trained neural network consisting of linear threshold functions. The first one leads to an algorithm that extracts rules in the form of Boolean functions. Compared with an existing one, this algorithm outputs much more concise rules if the threshold functions correspond to 1-decision lists, majority functions, or certain combinations of these. The second one extracts probabilistic rules representing relations between some of the input variables and the output using a dynamic programming algorithm. The algorithm runs in pseudo-polynomial time if each hidden layer has a constant number of neurons. We demonstrate the effectiveness of these two approaches by computational experiments.

Authors

  • Pengyu Liu
    Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan. Electronic address: liupengyu@kuicr.kyoto-u.ac.jp.
  • Avraham A Melkman
    Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel. Electronic address: melkman@cs.bgu.ac.il.
  • Tatsuya Akutsu
    Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Japan.