例2.1 求解:
对正实例点x1=(3,3)T,x2=(4,3)T,x1=(3,3)T,x2=(4,3)T,负实例点x3=(1,1)Tx3=(1,1)T
解 构建最优化问题:
按照感知机学习算法的原始形式求解w,b。η=1.w,b。η=1.
(1)取初值w0=[0,0],b0=0w0=[0,0],b0=0
(2)对x1=(3,3)T,y1(w0x1+b0)=0,x1=(3,3)T,y1(w0x1+b0)=0,未能被正确分类,更新w,bw,b
对x1=(3,3)T,y1(w1x1+b1)>0,x1=(3,3)T,y1(w1x1+b1)>0,
对x2=(4,3)T,y2(w1x2+b1)>0.x2=(4,3)T,y2(w1x2+b1)>0.
(3)对x3=(1,1)T,y3(w1x3+b1)<0,x3=(1,1)T,y3(w1x3+b1)<0,未能被正确分类,更新w1,b1w1,b1
(4)对x3=(1,1)T,y3(w2x3+b2)<0x3=(1,1)T,y3(w2x3+b2)<0,未能被正确分类,更新w2,b2w2,b2
(5)对x3=(1,1)T,y3(w3x3+b3)<0x3=(1,1)T,y3(w3x3+b3)<0,未能被正确分类,更新w3,b3w3,b3
对x3=(1,1)T,y3(w4x3+b4)>0.x3=(1,1)T,y3(w4x3+b4)>0.
(6)对x1=(3,3)T,y1(w4x1+b4)<0,x1=(3,3)T,y1(w4x1+b4)<0,未能被正确分类,更新w4,b4w4,b4
对x1=(3,3)T,y1(w5x1+b5)>0,x1=(3,3)T,y1(w5x1+b5)>0,
对x2=(4,3)T,y2(w5x2+b5)>0.x2=(4,3)T,y2(w5x2+b5)>0.
(7)对x3=(1,1)T,y3(w5x3+b5)<0,x3=(1,1)T,y3(w5x3+b5)<0,未能被正确分类,更新w5,b5w5,b5
(8)对x3=(1,1)T,y3(w6x3+b6)<0,x3=(1,1)T,y3(w6x3+b6)<0,未能被正确分类,更新w6,b6w6,b6
对x1=(3,3)T,y1(w7x1+b7)>0,x1=(3,3)T,y1(w7x1+b7)>0,
对x2=(4,3)T,y2(w7x2+b7)>0.x2=(4,3)T,y2(w7x2+b7)>0.