Univariate Margin Tree
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 Machine Convex Optimization Good Split Multiclass Problem Univariate Margin
Unable to display preview. Download preview PDF.
- 1.Mitchell, T.: Machine Learning. McGraw-Hill (1997)Google Scholar
- 2.Alpaydin, E.: Introduction to Machine Learning. The MIT Press (2010)Google Scholar
- 3.Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Meteo, CA (1993)Google Scholar
- 4.Quinlan, J.R.: Induction of decision trees. Machine Learning 1 (1986) 81–106Google Scholar
- 6.Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. John Wiley and Sons (2001)Google Scholar
- 9.Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)Google Scholar