Skip to main content
. 2017 Jun 13;17(6):1370. doi: 10.3390/s17061370
Algorithm 1. Algorithm for inserting and deleting processes of universal incremental LS-SVM.
Inserting Deleting
Input: S(l1)={(xi,yi)}i=1,ipl, R(l1), (xp,yp), 1pl, C Input: S(l)={(xi,yi)}i=1l, R(l), 1pl
Output: R(l), α(l), b(l) Output: R(l1), α(l1), b(l1)
1 WR(l1) 1 UR(l)
2 [W1W2OW3]W //divide at pth row and clomn 2 [U1u1U20Tuppu2TO0U3]U //divide at pth, p + 1st row and clomn
3 h1[k(x1,xp),,k(xp1,xp)]T 3 W1U1,W2U2
4 h2[k(xp+1,xp),,k(xl,xp)]T 4 W3TW3U3TU3+u2u2T //low-rank update
5 hppk(xp,xp)+1/C 5 W[W1W2OW3]
6 U1W1,U2W2 6 b(l1)EVTW1(WT)1YEVTW1(WT)1EV
7 u1(U1T)1h1 //forward substitution 7 α(l1)W1(WT)1(YbEV)
8 u2(h2U2Tu1)/upp 8 R(l1)W
9 U3TU3W3TW3u2u2T //low-rank downdate
10 U[U1u1U20Tuppu2TO0U3]
11 b(l)EVTU1(UT)1YEVTU1(UT)1EV //forward substitution
12 α(l)U1(UT)1(YbEV) //forward substitution
13 R(l)U