Sponsor
Portland State University. Department of Mathematics
First Advisor
Maria Balogh
Date of Publication
7-25-1974
Document Type
Thesis
Degree Name
Master of Science (M.S.) in Mathematics
Department
Mathematics
Language
English
Subjects
Nets (Mathematics)
DOI
10.15760/etd.1998
Physical Description
1 online resource (62 p.)
Abstract
Let a probability driven switch be defined as a switch of three input paths and three output paths. The status of the input paths defines a probability for each output path (as to whether it will generate a signal or not.) One output path is linked to one input path, so the results of the switch at time t can affect the switch at time t+1. A switch so constructed can be defined (by the probabilities) to take on the function of the standard logic gates (AND, OR, …) A net constructed of these switches can be “taught” by “reward” and “punish” algorithms to recognize input patterns. A simulation model showed that a repetitive learning algorithm coupled with a base knowledge (where new patterns are learned while continually checking past learned patterns) gives best results as a function of time. A good measure for the level of stability in response is to notice how many probabilities have converged to one or zero. The larger the number, the more stable the net.
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Persistent Identifier
http://archives.pdx.edu/ds/psu/12730
Recommended Citation
Carter, Lynn Robert, "Probability driven heuristic nets" (1974). Dissertations and Theses. Paper 1999.
https://doi.org/10.15760/etd.1998