On constructing threshold networks for pattern classification

This paper describes a method of constructing one-hidden layer feedforward linear threshold networks to represent Boolean functions (or partially-defined Boolean functions). The first step in the construction is sequential linear separation, a technique that has been used by a number of researchers [7, 11, 2]. Next, from a suitable sequence of linear separations, a threshold network is formed. The method described here results in a threshold network with one hidden layer. We compare this approach to the standard approach based on a Boolean function’s disjunctive normal form and to other approaches based on sequential linear separation [7, 11]