|  | Dawson, Michael R. W. Connectionism A Hands-on Approach
  1. Auflage Februar 2005 42,90 Euro 2005. 208 Seiten, Softcover ISBN 978-1-4051-2807-0 - John Wiley & Sons
Preis inkl. Mehrwertsteuer zzgl. Versandkosten.
Auch verfügbar als Hardcover. |
| Jetzt kaufen
|
| Langtext Connectionism is a "hands on" introduction to connectionist modeling through practical exercises in different types of connectionist architectures.
* explores three different types of connectionist architectures - distributed associative memory, perceptron, and multilayer perceptron
* provides a brief overview of each architecture, a detailed introduction on how to use a program to explore this network, and a series of practical exercises that are designed to highlight the advantages, and disadvantages, of each
* accompanied by a website at http://www.bcp.psych.ualberta.ca/~mike/Book3/ that includes practice exercises and software, as well as the files and blank exercise sheets required for performing the exercises
* designed to be used as a stand-alone volume or alongside Minds and Machines: Connectionism and Psychological Modeling (by Michael R.W. Dawson, Blackwell 2004)
Aus dem Inhalt 1. Hands-on Connectionism.
2. The Distributed Associative Memory.
3. The James Program.
4. Introducing Hebb Learning.
5. Limitations Of Hebb Learning.
6. Introducing The Delta Rule.
7. Distributed Networks And Human Memory.
8. Limitations Of Delta Rule Learning.
9. The Perceptron.
10. The Rosenblatt Program.
11. Perceptrons And Logic Gates.
12. Performing More Logic With Perceptrons.
13. Value Units And Linear Nonseparability.
14. Network By Problem Type Interactions.
15. Perceptrons And Generalization.
16. Animal Learning Theory And Perceptrons.
17. The Multilayer Perceptron.
18. The Rumelhart Program.
19. Beyond The Perceptron's Limits.
20. Symmetry As A Second Case Study.
21. How Many Hidden Units?.
22. Scaling Up With The Parity Problem.
23. Selectionism And Parity.
24. Interpreting A Small Network.
25. Interpreting Networks Of Value Units.
26. Interpreting Distributed Representations.
References.
|
|
| |