Clasified in Notes of Computers of University.
Written at November 18, 2009 on
English with a size of 3,102 bytes.
ñ=(0,0,0...)t
while the points not yet clasified do
pick-up a ponut pi
if pi € class o and ñt.pi<=0 then
ñ=ñ+pi
else if pi € class 1 and ñtpi>=0 then
ñ=ñ-pi
end if
end while
ñ=(0,0,0...)t
while the points not yet clasified do
Añ=(0,0...0)
if pi € class o and ñt.pi<=0 then
Añ=Añ+pi
else if pi € class 1 and ñtpi>=0 then
Añ=Añ-pi
end if
ñ=ñ+Añ
end while
ñ1=(0,0...0) ñ2=(0,0...0) ñ3=(0,0...0)
while not all point clasified do
take point i from classs k
for every class j <> k do
if ñkt.pi-nj.pi =0 then
nk=nk+pi
nj=nj+pi
end if
end for
end while
W1=W2=W3=(0..0)t
while not all point clasified do
Aw1=AW2=...=AW=(0..o)t
for i=1 to n classes
for j=1 to n points (classi)
for k=1 to n classess
if(k<>i) and witpj-wk.pd<=0
Awi=Awi+pj
Awk=Awk+pj
end if
end for
end for
end for
wi=wi +Awi+...wm=w+Awm
end while
| Did you this document helpful? | ||
|---|---|---|
| 1 visitors likes this document. | 100% | |
| 0 visitors dislike this document. | ||
| Tags:perceptor,multicast simple perceptor,simple bi-class perceptom,class,pi,and | |
| This document has been visited 24 times and has received 1 votes |