Department of Numerical Analysis and Computing Science, the Royal Institute of Technology, S-100 44, Stockholm, Sweden.
IEEE Trans Pattern Anal Mach Intell. 1985 Apr;7(4):490-8. doi: 10.1109/tpami.1985.4767688.
Previous investigations of the storage capacity of associative nets have not explicitly considered quantitative aspects of the tradeoff between storage capacity and reconstructive power in these systems. Furthermore, few comparisons have been made between theoretical estimates and experimental results (simulations). In this correspondence, we describe some results recently obtained and relevant to these issues. It is shown that a high storage capacity is possible, without sacrificing reliability in the recall process. Furthermore, an efficient algorithm for retrieval of the information stored is presented, and the speed of recall employing various degrees of parallelism is discussed.
以前对联想网络存储容量的研究并没有明确考虑到这些系统中存储容量和重构能力之间权衡的定量方面。此外，理论估计和实验结果（模拟）之间的比较也很少。在本通信中，我们描述了最近获得的一些与这些问题相关的结果。结果表明，在不牺牲召回过程可靠性的情况下，可以实现高存储容量。此外，还提出了一种用于检索存储信息的有效算法，并讨论了使用不同并行度进行召回的速度。
