Skip to main content
. 2019 Mar 5;21(3):247. doi: 10.3390/e21030247
C-SBL Algorithm:
{Θ(i)}i=1toNcollect=CSBL(Y,A,Θ0,Nburnin,Ncollect)
For Iter=1toNburnin+Ncollect
  % Support-learning vector component
  For p=1toP
   y˜mnp=ymnlpPamlslxln, m=1toM,n=1toN
   cp=1γpγpΣ1,pP+1Σ1,p, (ΣΔ¯)p=(ΣΔ)0,p(ΣΔ)1,p
   kp=eε2(ap22n=1Nxpn2)2apT(n=1Nxpny˜np)
   (sp|)Bernoulli(11+cpkpeα(ΣΔ¯)p)
   % Solution-value matrix component
   For l=1toP
    σx=(τ+εsl2al22)1
    μ¯=εslσxal
    y˜nl=ynA(sxn)+slxlnal,n=1,,N
    (xln|)N(μ¯Ty˜nl,σx),n=1,,N
   End For{l}
   (γp|)Betaα0+1+2kpPsk,β01+2(PkpPsk)
   End For{p}
   (τ|)Gamma(a0+NP2,b0+12XF2)
   (ε|)Gamma(θ0+MN2,θ1+12YA(sX)F2)
   α: obtained from solving (20) for α[t+1]
   Θ(IterNburnin)Θ, Iter>Nburnin
  End For{Iter}