Multi-path Decision Tree
- https://doi.org/10.2991/iccsee.2013.355How to use a DOI?
- component, formatting, style, styling, insert
Decision trees are well-known and established models for classification and regression. In this paper, we propose multi-path decision tree algorithm (MPDT). Different from traditional decision tree where the path of each record is deterministic and exclusive, a record can trace several paths simultaneously in multi-path decision tree so that it has the effect of ensemble classifiers with only one classifier. Local class information gain is the value of class information (entropy or Gini, etc) given the value of an attribute relative to class information unsupervised. We examine the MPDT on a random selection of 26 benchmark data sets from the UCI repository and compared it with Bagging, AdaBoost and C4.5. The results note that MPDT has better performance.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Huaping Guo AU - Ming Fan PY - 2013/03 DA - 2013/03 TI - Multi-path Decision Tree BT - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013) PB - Atlantis Press SP - 1411 EP - 1413 SN - 1951-6851 UR - https://doi.org/10.2991/iccsee.2013.355 DO - https://doi.org/10.2991/iccsee.2013.355 ID - Guo2013/03 ER -