Simplest implementation

• Weight vectors & input patterns all have length 1 (e.i., ? (wij)2 = 1 )

• Find node whose weight vector has mimimal distance to the input vector:

  min. ? (aj - wij)2
  

• Activate all nodes in neighbourhood radius Nt

• Update weights of active nodes by moving weights towards the input vector:

  ?wij = ?t * ( aj - wij)
  

wij(t+1) = wij(t) + ?t * ( aj - wij(t) )