Abstract
Times of searching for similar binary vectors in neural-net and traditional associative memories are investigated and compared. The neural-net approach is demonstrated to surpass the traditional ones even if it is implemented on a serial computer when the entropy of a space of signals is of order of several hundreds and the number of stored vectors is vastly larger than the entropy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proc. Nat. Acad. Sci. USA, 79, 2554–2558 (1982).
G. A. Kohring, “Convergence time and finite size effects in neural networks,” J. Phys. A: Math. Gen., 23, 2237–2241 (1990).
D. O. Gorodnichi and A. M. Reznik, “Increasing attraction of pseudo-inverse autoassociative networks,” Neural Proces. Lett., 5(2), 123–127 (1997).
A. K. Dekhtyarenko and D. V. Novitskii, “Neural associative memory with cellular structure,” Mat. Mashiny i Sistemy, No. 3, 37–44 (2002).
A. A. Frolov, D. A. Rachkovskij, and D. Husek, “On information characteristics of Willshaw-like auto-associative memory,” Neural Network World, 2, 141–157 (2002).
D. A. Rachkovskii, I. S. Misuno, S. V. Slipchenko, and A. M. Sokolov, “Search for analogues with the help of distributed representations,” Problemy Programmirovaniya, No. 1, 39–50 (2005).
D. A. Rachkovskij and E. M. Kussul, “Binding and normalization of binary sparse distributed representations by context-dependent thinning,” Neural Comput., 13(2), 411–452 (2001).
A. A. Frolov, D. Husek, and I. P. Muraviev, “Information capacity and recall quality in sparsely encoded Hopfield-like neural network: Analytical approaches and computer simulation,” Neural Networks, 10(5), 845–855 (1997).
A. A. Frolov, D. Husek, and I. P. Muraviev, “Informational efficiency of sparsely encoded Hopfield-like associative memory,” Optical Memory & Neural Networks (Inform. Optics), 12(3), 177–197 (2004).
G. Palm, “Computing with neural networks,” Science, 235, 1227–1228 (1987).
J. Buhmann, R. Divko, and K. Schulten, “Associative memory with high information content,” Phys. Rev., 39, 2689–2692 (1989).
M. V. Tsodyks and M. V. Feigelman, “The enhanced storage capacity in neural network with low activity level,” Europhys. Lett., 6, 101–105 (1988).
Author information
Authors and Affiliations
Additional information
This work is supported by RFBR grant 05-07-90049 and partially by the Center of Applied Cybernetics under grant No. 1M6840070004 (Institutional Research Plan AV0Z10300504).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 3–13, September–October 2006.
Rights and permissions
About this article
Cite this article
Frolov, A.A., Husek, D. & Rachkovskii, D.A. Time of searching for similar binary vectors in associative memory. Cybern Syst Anal 42, 615–623 (2006). https://doi.org/10.1007/s10559-006-0098-z
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-006-0098-z