Associative learning using ising-like model

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a new computational model of associative learning is proposed, which is based on the Ising model. Application of the stochastic gradient descent algorithm to the proposed model yields an on-line learning rule. Next, it is shown that the obtained new learning rule generalizes two well-known learning rules, i.e., the Hebbian rule and the Oja’s rule. Later, the fashion of incorporating the cognitive account into the obtained associative learning rule is proposed. At the end of the paper, experiments were carried out for testing the backward blocking and the reduced overshadowing and blocking phenomena. The obtained results are discussed and conclusions are drawn.

Cite

CITATION STYLE

APA

Tomczak, J. M. (2014). Associative learning using ising-like model. In Advances in Intelligent Systems and Computing (Vol. 240, pp. 295–304). Springer Verlag. https://doi.org/10.1007/978-3-319-01857-7_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free