Time of searching for similar binary vectors in associative memory

DOI10.1007/S10559-006-0098-ZMaRDI QIDQ2371729zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 5 July 2007

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-006-0098-z

zbMATH Keywords

associative memorybinary vectorhashingHopfield networkindexingneural network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2099572
• scientific article; zbMATH DE number 1989744
• Neural associative memory for brain modeling and information retrieval
• W-neural networks in the problem of associative memory
• Index structures for fast similarity search for binary vectors

Cites work

• Binding and normalization of binary sparse distributed representations by context-dependent thinning
• Neural networks and physical systems with emergent collective computational abilities

Cited in

(8)

• Binary vectors for fast distance and similarity estimation
• Formation of similarity-reflecting binary vectors with random binary projections
• Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits
• Randomized projective methods for the construction of binary sparse vector representations
• Index structures for fast similarity search for binary vectors
• Index structures for fast similarity search for real vectors. II
• Vector data transformation using random binary matrices
• Estimation of vectors similarity by their randomized binary projections

This page was built for publication: Time of searching for similar binary vectors in associative memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371729)