lvq1 - 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/ lvq1 Purpose Trains codebook with the LVQ1 -algorithm (described below). Syntax sM = lvq1(sM, D, rlen, alpha) Description Trains codebook with the LVQ1 -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 the first column of data or map -structs' .labels -field). For each xj there is defined the nearest codebook -vector index c by searching the minimum of the euclidean distances between the current xj and codebook -vectors: c = min{ ||xj - mi|| }, i=[1,. .,n], for fixed xj i If xj and mc belong to the same class, mc is updated as follows: mc(t+1) = mc(t) + alpha * (xj(t) - mc(t)) If xj and mc belong to different classes, mc is updated as follows: mc(t+1) = mc(t) - alpha * (xj(t) - mc(t)) Otherwise updating is not performed. Argument 'rlen' tells how many times training sequence is performed.
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

lvq1 - 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