Chapter 6 Architecture and Equilibria 6.3 Synaptic convergence to centroids:AVQ Al gor i thms The Stochastic unsupervised competitive learning law: m)=S0y儿x-m]+n 6-10 We assume S≈ID(x)6-11 The equilibrium and convergence depend on approximation (6-11),so 6-10 reduces m=D(x儿x-m]+n 6-12 2006.11.10 92006.11.10 9 Chapter 6 Architecture and Equilibria 6.3 Synaptic convergence to centroids: AVQ Algorithms The Stochastic unsupervised competitive learning law: = ( )[ − ]+ 6 −10 • j j j mj nj m S y x S  I (x) 6−11 Dj j We assume The equilibrium and convergence depend on approximation (6-11) ,so 6-10 reduces : = ( )[ − ]+ 6 −12 • j D mj nj m I x x j