6.3 Synaptic convergence to centroids:AVQ Algorithms The linear differential competitive learning law: m,=S,[x-mj1+nj In practice: in,=sgn[yx-mjl+nj 1 讨z>0 讨z=0 2003.11.19 92003.11.19 9 6.3 Synaptic convergence to centroids: AVQ Algorithms The linear differential competitive learning law: In practice: [ ] m S x m n j j j j = − + sgn[ ][ ] 1 0 sgn[ ] 0 0 1 0 m y x m n j j j j if z z if z if z = − +    = =    − 