Hi, I don't know if this belongs here or the maths forums. I'm trying to create a recurring self organizing map. I've created a normal SOM, which works fine. However, in order to make it recurrent, I need to add a leaky integrator in the competition step. I understand the most of the theory of this (I'm not much of a mathematician), but I don't know how to convert that into programming. Does anyone have experience with RSOM's and psuedo code for how it should be set up. In the normal SOM, the competition step finds the distance (Euclidean) between the codebook node and the input vector, but how do I extend this to an RSOM. The leaky integrator formula is: Yi(n) = (1-alpha)Yi(n-1) + alpha(x(n) - Wi(n)) alpha is the learning rate and Yi is the difference vector. Any help would be appreciated. Thanks