On a Model of Human Associative Processor --HASP--
Summary :
HASP, a model of Human Associative Processor, has been proposed in a previous paper. Among other associative memory models hitherto proposed, HASP is unique in its multiple match resolution. By this function several items associated with one particular key can be retrieved one by one, and set-theoretically defined multiple key search operations can be performed. However, there was a problem in the performance of HASP. It was the occurance of unknown patterns in a recollection sequence of multiply matched items. It would become a serious defect in appling HASP to such a task as serial association, in which an output became a key input for the next association. In this paper, the origin of the problem is identified and HASP is improved not to produce unknown patterns. The idea is to weaken the competitive powers of the unknown patterns by modifying the strength of inhibitory recurrent paths. A series of simulation studies has been carried out and it is confirmed that the improved HASP can perform multiple key search operations without being contaminated by unknown patterns. Several psychological implications of the performance of HASP are also discussed.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E69-E No.4 pp.549-557
- Publication Date
- 1986/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Pattern Recognition and Learning
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yuzo HIRAI, "On a Model of Human Associative Processor --HASP--" in IEICE TRANSACTIONS on transactions,
vol. E69-E, no. 4, pp. 549-557, April 1986, doi: .
Abstract: HASP, a model of Human Associative Processor, has been proposed in a previous paper. Among other associative memory models hitherto proposed, HASP is unique in its multiple match resolution. By this function several items associated with one particular key can be retrieved one by one, and set-theoretically defined multiple key search operations can be performed. However, there was a problem in the performance of HASP. It was the occurance of unknown patterns in a recollection sequence of multiply matched items. It would become a serious defect in appling HASP to such a task as serial association, in which an output became a key input for the next association. In this paper, the origin of the problem is identified and HASP is improved not to produce unknown patterns. The idea is to weaken the competitive powers of the unknown patterns by modifying the strength of inhibitory recurrent paths. A series of simulation studies has been carried out and it is confirmed that the improved HASP can perform multiple key search operations without being contaminated by unknown patterns. Several psychological implications of the performance of HASP are also discussed.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e69-e_4_549/_p
Copy
@ARTICLE{e69-e_4_549,
author={Yuzo HIRAI, },
journal={IEICE TRANSACTIONS on transactions},
title={On a Model of Human Associative Processor --HASP--},
year={1986},
volume={E69-E},
number={4},
pages={549-557},
abstract={HASP, a model of Human Associative Processor, has been proposed in a previous paper. Among other associative memory models hitherto proposed, HASP is unique in its multiple match resolution. By this function several items associated with one particular key can be retrieved one by one, and set-theoretically defined multiple key search operations can be performed. However, there was a problem in the performance of HASP. It was the occurance of unknown patterns in a recollection sequence of multiply matched items. It would become a serious defect in appling HASP to such a task as serial association, in which an output became a key input for the next association. In this paper, the origin of the problem is identified and HASP is improved not to produce unknown patterns. The idea is to weaken the competitive powers of the unknown patterns by modifying the strength of inhibitory recurrent paths. A series of simulation studies has been carried out and it is confirmed that the improved HASP can perform multiple key search operations without being contaminated by unknown patterns. Several psychological implications of the performance of HASP are also discussed.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - On a Model of Human Associative Processor --HASP--
T2 - IEICE TRANSACTIONS on transactions
SP - 549
EP - 557
AU - Yuzo HIRAI
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1986
AB - HASP, a model of Human Associative Processor, has been proposed in a previous paper. Among other associative memory models hitherto proposed, HASP is unique in its multiple match resolution. By this function several items associated with one particular key can be retrieved one by one, and set-theoretically defined multiple key search operations can be performed. However, there was a problem in the performance of HASP. It was the occurance of unknown patterns in a recollection sequence of multiply matched items. It would become a serious defect in appling HASP to such a task as serial association, in which an output became a key input for the next association. In this paper, the origin of the problem is identified and HASP is improved not to produce unknown patterns. The idea is to weaken the competitive powers of the unknown patterns by modifying the strength of inhibitory recurrent paths. A series of simulation studies has been carried out and it is confirmed that the improved HASP can perform multiple key search operations without being contaminated by unknown patterns. Several psychological implications of the performance of HASP are also discussed.
ER -
English
