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

    k←0

  •   2:

    Define a prior-tree, T0

  •   3:

    Train T0 with xtrain(X,VM)

  •   4:

    for n∈L0 do

  •   5:

          k←k+1

  •   6:

          Define a sub tree Tk

  •   7:

          Xk←X0,n

  •   8:

          Train Tk with xtrain(Xk,VR)

  •   9:

          T0,n←Tk,0 (Graft Tk to the leaf of T0)

  • 10:

    end for