Algorithm 3 Construct an Evidential Decision Tree

Require: Set attributes as Features. Set classes as A,B,C, etc. Ensure: An Evidential Decision Tree.  for All samples do   for All Feature do    if Feature≥max($B_{max},C_{max},A_{min},\cdots$)    && Feature1≤min($A_{max},B_{min},C_{min},\cdots$) then     return A.    end if    if Feature≥max($A_{max},C_{max},B_{min},\cdots$) && Feature1≤min($B_{max},A_{min},C_{min},\cdots$) then     return B.    end if    if Feature≥max($A_{max},B_{max},C_{min},\cdots$) && Feature1≤min($C_{max},A_{min},B_{min},\cdots$) then     return C.    end if   end for  end for