Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition

DOI10.1088/0954-898X/6/4/002MaRDI QIDQ4869674zbMATH OpenOpenAlexFDO

Authors

Publication date 12 March 1996

Full work available at URL https://doi.org/10.1088/0954-898x/6/4/002

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1181907
• scientific article; zbMATH DE number 1989744
• Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction
• scientific article; zbMATH DE number 2099572
• scientific article; zbMATH DE number 1164156

Cited in

(7)

• Formation of similarity-reflecting binary vectors with random binary projections
• Threshold-linear formal neurons in auto-associative nets
• scientific article; zbMATH DE number 1181907 (Why is no real title available?)
• scientific article; zbMATH DE number 2099572 (Why is no real title available?)
• Quality and efficiency of retrieval for Willshaw-like autoassociative networks. I. Correction
• Storing object-dependent sparse codes in a Willshaw associative network
• Vector data transformation using random binary matrices

This page was built for publication: Quality and efficiency of retrieval for Willshaw-like autoassociative networks. II. Recognition

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