Decisions Tree Learning Method Based on Three-Way Decisions
Aiming at the problems that traditional data mining methods ignore inconsistent data, and general decision tree learning algorithms lack of theoretical support for the classification of inconsistent nodes. The three-way decision is introduced to decision tree learning algorithms,and the decision tree learning method based on three-way decisions is proposed. Firstly, the proportion of positive objects in node is used to compute the conditional probability of the three-way decision of node. Secondly, the nodes in decision tree arepartitioned to generate the three-way decision tree. The merger and pruning rules of the three-way decision tree are derived to convert the three-way decision tree into two-way decision tree by considering the information around nodes. Finally, an exampleisimplemented. The results show that the proposed method reserves inconsistent information, partitions inconsistent nodes by minimizing the overall risk, not only generates decision tree with cost-sensitivity, but also makes the partition of inconsistent nodes more explicable. Besides, the proposed method reduces the overfitting to some extent and the computation problem of conditional probability of three-way decisions is resolved.
KeywordsThree-way decisions Decision tree Conditional probability Boundary nodes Minimizing the overall risk Merger and pruning
The authors wish to thank the anonymous reviewers and Editor-in-Chief for their valuable comments and hard work. This work was supported by the National Natural Science Foundation of China (Nos. 61370169, 61402153,60873104), the Key Project of Science and Technology Department of Henan Province (Nos. 142102210056, 112102210194), the Science and Technology Research Key Project of Educational Department of Henan Province (Nos.12A520027, 13A520529), the Key Project of Science and Technology of Xinxiang Government (No. ZG13004), the Education Fund for Youth Key Teachers of Henan Normal University, and the 2014 Henan Normal University Youth Science Fund(No. 2014QK28).
- 1.Qian, W.B., Yang, B.R., Xu, Z.Y., Xie, Y.H.: Rule extraction algorithm based on discernibility matrix in inconsistent decision table. Comput. Sci. 40(6), 215–218 (2013)Google Scholar
- 4.Hong, K.S., Melanie, P.O., Ye, C.K.: Sparse alternating decision tree. Pattern Recogn. Lett. 60, 57–64 (2015)Google Scholar
- 6.Chen, J.K., Wang, X.Z., Gao, X.H.: Improved ordinal decisions trees algorithms based on rank entropy. Pattern Recogn. Artif. Intell. 27(2), 134–140 (2014)Google Scholar
- 7.Ruan, X.H., Huang, X.M., Yuan, D.R., Duan, Q.L.: Classification algorithm based on heterogeneous cost-sensitive decision tree. Comput. Sci. 40(11A), 140–142 (2013)Google Scholar
- 8.Jia, X.Y., Shang, L., Zhou, X.Z., Liang, J.Y., Miao, D.Q., Wang, G.Y., Li, T.R., Zhang, Y.P.: The Theory and Application of Three-way Decision. Nanjing University Press, Nanjing (2012)Google Scholar
- 14.Li, H.: Statistical Learning Method. Tsinghua University Press, Beijing (2012) Google Scholar
- 17.Liu, D., Yao, Y.Y., Li, T.R.: Three-way decision-theoretic rough sets. Comput. Sci. 38(1), 246–250 (2011)Google Scholar
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.