Talk:Kohonen Map

Some thought on the Kohonen Map. From my recent char with Chase, where he asked me what is the difference between this and k-means clustering. Basically this is more statistical but the k-means is more logged. So he said that this *should* work better against statistical movement (or something like this).

Now I wonder, basically in VCS we set segmentation. How about initialize each node's input with every possible groups of segmentation, then let it adjust dynamically for the input situation. (That is, we simulate each stats buffer in the VCS system with an adjustable node). Any thoughts? --Nat Pavasant 14:59, 10 November 2009 (UTC)