Chapter 6 Architecture and Equilibria 6.3 Synaptic convergence to centroids:AVQ Al gor ithms Competitive AVQ Algorithms 1.Initialize synaptic vectors: m,(0)=x(0,i=1,…,m 2.For random sample x()find the closet("winning")synaptic vector m (t) m,(0)-x0)=minm,(0-x06-13 where x=++x 3.Update the wining synaptic vectors()by the UCL.SCL,or DCL learning algorithm. 2006.11.10 102006.11.10 10 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