An unsupervised learning rule for class discrimination in a recurrent neural network

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

Abstract

A number of well-known unsupervised feature extraction neural network models are present in literature. The development of unsupervised pattern classification systems, although they share many of the principles of the aforementioned network models, has proven to be more elusive. This paper describes in detail a neural network capable of performing class separability through self-organizing Hebbian like dynamics, i.e., the network is able to autonomously find classes of patterns without the help from any external agent. The model is built around a recurrent network performing winner-takes-all competition. Automatic: labelling of input data samples is based upon the induced activity pattern after presentation of the sample. Neurons compete against each other through recurrent interactions to code the input sample. Resulting active neurons update their parameters to improve the classification process. Tho learning dynamics are moreover absolutely stable. © Springer-Vorlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

De La Cruz Gutiérrez, J. P. (2006). An unsupervised learning rule for class discrimination in a recurrent neural network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4131 LNCS-I, pp. 415–424). Springer Verlag. https://doi.org/10.1007/11840817_44

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