Chapter 6 Architecture and Equilibria 6.3 Synaptic convergence to centroids:AVQ Al gor i thms Competitive AVQ Algorithms 1.Initialize synaptic vectors: m,(0)=x(),i=1,,m 2.For random sample x()find the closet(winning)synaptic vector m,(t) m,()-x(t)=minm,()-x()儿6-13 where x2=x2+..+x品 3.Update the wining synaptic vectors m()by the UCL,SCL,or DCL learning algorithm. 2004.11.10 112004.11.10 11 Chapter 6 Architecture and Equilibria 6.3 Synaptic convergence to centroids:AVQ Algorithms Competitive AVQ Algorithms 1. Initialize synaptic vectors: mi (0) = x(i) , i =1,......,m 2.For random sample ,find the closet(“winning”)synaptic vector x(t) m (t) j 2 2 1 2 ....... ( ) ( ) min ( ) ( ) 6 13 m i i j where x x x m t x t m t x t = + + − = − − 3.Update the wining synaptic vectors by the UCL ,SCL,or DCL learning algorithm. m (t) j