Year: 2006
Type: article
Abstract: : Associative memories with recurrent connectivity can be built from networks of perceptrons and trained using the perceptron learning rule. Recent work has shown how a perceptron can be diluted, so that incoming connections are removed to produce an optimal perceptron. Such a perceptron classifies its training set with optimal margin and minimal connectivity. Here this technique is applied to perceptrons in associative memory networks. The main result shows that, by using these dilution methods, effective associative memories can be built with very sparse connectivity.
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W302994303
