Skip to main content
. 2025 Oct 23;25(21):6530. doi: 10.3390/s25216530
Algorithm 2 LDT testing process
  • 1:

    k0

  • 2:

    Run the prior-tree T0, with xtest(X,VM) and ytest(X)

  • 3:

    for nL0 do

  • 4:

          kk+1

  • 5:

          XkX0,n

  • 6:

          Run the sub tree Tk grafted at the leaf with xtest(Xk,VR) and ytest(Xk)

  • 7:

          ypred(Xk,n)yk,n

  • 8:

    end for