On the Complexity of Hierarchical Associative Memories
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207425" target="_blank" >RIV/00216208:11320/09:00207425 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the Complexity of Hierarchical Associative Memories
Original language description
Associative memories represent a model of artificial neural networks applicable to the information storage and retrieval. However, the performance of traditional associative memories is very sensitive to the number of stored patterns and their mutual similarities. In order to avoid limitations imposed by processing larger amounts of mutually correlated patterns, we have developed the so-called Hierarchical Associative Memory (HAM) model. This paper is focused on the time complexity and memory complexityof the HAM model. The time complexity of the HAM model is derived. The memory complexity is analyzed and the theoretical results are compared with the experimental results.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
24th Annual ACM Symposium on Applied Computing
ISBN
978-1-60558-166-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
ACM
Place of publication
New York, NY, USA
Event location
New York, NY, USA
Event date
Jan 1, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—