Univariate Margin Tree

Abstract

In many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin tree, where for each continuous attribute, the best split is found using convex optimization. Our simulation results on 47 datasets show that the novel margin tree classifier performs at least as good as C4.5 and LDT with a similar time complexity. For two class datasets it generates smaller trees than C4.5 and LDT without sacrificing from accuracy, and generates significantly more accurate trees than C4.5 and LDT for multiclass datasets with one-vs-rest methodology.KeywordsSupport Vector MachineConvex OptimizationGood SplitMulticlass ProblemUnivariate MarginThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.