Computing with discrete multi-valued neurons
Journal of Computer and System Sciences
Learning with discrete multivalued neurons
Journal of Computer and System Sciences
Discrete neural computation: a theoretical foundation
Discrete neural computation: a theoretical foundation
Capacity of multilevel threshold devices
IEEE Transactions on Information Theory
CARVE-a constructive algorithm for real-valued examples
IEEE Transactions on Neural Networks
Enumeration of linear threshold functions from the lattice of hyperplane intersections
IEEE Transactions on Neural Networks
STRIP - a strip-based neural-network growth algorithm for learning multiple-valued functions
IEEE Transactions on Neural Networks
On encoding and enumerating threshold functions
IEEE Transactions on Neural Networks
Hi-index | 0.01 |
This paper concerns how to compute multi-valued functions using three-layer feedforward neural networks with one hidden layer. Firstly, we define strongly and weakly symmetric functions. Then we give a network to compute a specific strongly symmetric function. The number of the hidden neurons is given and the weights are 1 or -1. Algorithm 1 modifies the weights to real numbers to compute arbitrary strongly symmetric functions. Theorem 3 extends the results to compute any multi-valued functions. Finally, we compare the complexity of our network with that of binary one. Our network needs fewer neurons.