We study the recognition properties of a modification of the Willshaw associative memory with a floating threshold analytically for the asymptotic case of large networks and single-step retrieval. The number of spurious stable states and the size of their attraction basins are calculated. Comparison is made with simulations for single- and multistep dynamics. The appropriateness of the recognition procedure based on the remanent overlap is demonstrated.
No takes yet. Share an insight, caveat, or question.
Frolov et al. (1995) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: