ACM Home Page
Please provide us with feedback. Feedback
Relating number of processing elements in a sparse distributed memory model to learning rate and generalization
Full text PdfPdf (667 KB)
Source International Conference on APL archive
Proceedings of the international conference on APL '91 table of contents
Palo Alto, California, United States
Pages: 166 - 173  
Year of Publication: 1991
ISBN:0-89791-441-4
Also published in ...
Authors
Richard M. Evans  Performance and Task Division, Defense Training and Performance Data Center, Orlando, Florida
Alvin J. Surkan  Department of Computer Science, University of Nebraska, Lincoln, Nebraska
Sponsors
SIGAPL: ACM Special Interest Group on APL Programming Language
APLBUG :
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/114054.114073
What is a DOI?

ABSTRACT

A simulated neural network was developed with APL on an 80386 microcomputer. The network was configured to associate task descriptions with 10 categories of military occupational specialties. The number of processing elements in the problem was varied. Increasing the number of processors increased the speed of learning in the simulation. Generalization was not significantly different for various numbers of processing elements except for one intermediate number at which generalization occurred about 15 percent higher. Analysis of the performance of a trained network suggests that low level, natural language understanding is one form of text processing which promises to become an important application area for neural model-based computing.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Bereiter, "Implications of Connectionism for Thinking about Rules," Educational Researcher, vol. 20, no. 3, pp. 10-16, (April, 1991.)
 
2
L. Cartwright, "Task classification: Proposed Approach and Applications," Paper presented to the Defense Training and Performance Data Center, Orlando, Florida, (September, 1990.)
 
3
G. DeJong, " ' Skimming Stories in Real Time: An Experiment in Integrated Understanding," Research Report 158, Department of Computer Science, Yale University, (1979).
 
4
E. R. Hilgard and G. H. Bower, Theories of Learning, Appelton-Century-Crofts, New York, (1956).
5
 
6
 
7
J. Martin, "Text Management's Mission: Locate What's Relevant," PC Week, p. 68, (27 August 1990.)
 
8
 
9
B. Sudheim, "Second Message Understanding Conference (MUCK-II) Test Report," Technical Report 1328, Naval Ocean Systems Center, San Diego, CA, 1990.
10
 
11
S. Young and P. Hayes, "Automatic Classification and Summarization of Banking Telex," The Second Conference on Artificial Intelligence Applications. Washington, DC: IEEE Computer Society Press, pp. 402-408, (1985).


Collaborative Colleagues:
Richard M. Evans: colleagues
Alvin J. Surkan: colleagues

Peer to Peer - Readers of this Article have also read: