Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898714807 Academic Inspection Copy

Discrete Mathematics of Neural Networks

Selected Topics
Description
Table of
Contents
Sales
Points
Google
Preview
This text offers a sampling of the expanding field of artificial neural network theory. It considers select areas of discrete mathematics linking combinatorics and the theory of the simplest types of artificial neural networks. Neural networks have emerged as a key technology in many fields of application, and an understanding of the theories concerning what such systems can and cannot do is essential. The author discusses connections between special types of Boolean functions and the simplest types of neural networks. Some classical results are presented with accessible proofs, together with some more recent perspectives, such as those obtained by considering decision lists. In addition, probablistic models of neural network learning are also discussed and graph theory, some partially ordered set theory, computational complexity, and discrete probability are among the mathematical topics involved.
Preface; 1. Artificial Neural Networks; 2. Boolean Functions; 3. Threshold Functions; 4. Number of Threshold Functions; 5. Sizes of Weights for Threshold Functions; 6. Threshold Order; 7. Threshold Networks and Boolean Functions; 8. Specifying Sets; 9. Neural Network Learning; 10. Probabilistic Learning; 11. VC-Dimensions of Neural Networks; 12. The Complexity of Learning; 13. Boltzmann Machines and Combinatorial Optimization; Bibliography; Index.
Considers key aspects of the burgeoning field of artificial neural network theory.
Google Preview content