Ia

Clasified in Notes of Computers of University.

Written at November 18, 2009 on enEnglish with a size of 1,369 bytes.

In order to proove the converge, proove the cardinality:

ñfT.Yi>0 

ñfT.Zi>0

?=min(ñft.zi)

a.b=||a||.||b||.cos?;cos?€[-1,1]

||a||.||b||>=a.b

||ñf||.||ñk||>=ñft.ñ(k)>k.?

||ñf||2.||ñ(k)||2>=k2.?2

inecuality1:||ñf||2.||ñ(k)||2>=k2.?2  ?=min(ñf2.zi)

ñ(k) =ñ(k-1)+yk  y={z1,z2,z3}={y1,y2,y3}(we put yk because yk is badly clasified by ñ(k-1).yk<=0)

...ñ(k)t.ñ(k)=[ñ2(k-1)+yk]t.[ñ2.(k-1)+yk]t.[ñ(k-1)+yk]=...inecualiti2:||ñ(k)||2=<?ki=1yityi<=k?   ?=max(zit.zi)

k<=||ñf||2.?/?2-->it converges

linear separator

po->(media) n->(final-principio)

nt(p-p0)->(0,26 -43)(p1;p2)-(0,26 -43)(1,91;131)

0,26p1-43p2+5654=0-->linear ecuation

Euclidear distance

r1= (r1;-1/2r1tr1)

Tags:IA
This document has been visited 32 times and has received 1 votes
Write a comment
© Wikiteka, 2010
Chuletas  |  Apuntes