lvq3 - SOM Toolbox Online documentation

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
SOM Toolbox Online documentation http://www.cis.hut.fi/projects/somtoolbox/ lvq3 Purpose Trains codebook with the LVQ3 -algorithm (described below). Syntax sM = lvq3(sM, data, rlen, alpha, win, epsilon) Description Trains codebook with the LVQ3 -algorithm. Codebook contains a number of vectors (mi, i=1,2,. ..,n) and so does data (vectors xj, j=1,2,. ..k). Both vector sets are classified: vectors may have a class (classes are set to data- or map -structure's 'labels' -field. For each xj the two closest codebookvectors mc1 and mc2 are searched (euclidean distances d1 and d2). xj must fall into the zone of window. That happens if: min(d1/d2, d2/d1) > s, where s = (1-win) / (1+win). If xj belongs to the same class of one of the mc1 and mc1, codebook is updated as follows (let mc1 belong to the same class as xj): mc1(t+1) = mc1(t) + alpha * (xj(t) - mc1(t)) mc2(t+1) = mc2(t) - alpha * (xj(t) - mc2(t)) If both mc1 and mc2 belong to the same class as xj, codebook is updated as follows: mc1(t+1) = mc1(t) + epsilon * alpha * (xj(t) - mc1(t))
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/23/2010 for the course CS 245 taught by Professor Dunno during the Spring '10 term at Aarhus Universitet.

Page1 / 3

lvq3 - SOM Toolbox Online documentation

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online