[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.3837/tiis.2020.10.005

Knowledge Representation Using Decision Trees Constructed Based on Binary Splits

Azad, Mohammad (College of Computer and Information Sciences, Jouf University)

Publication Information

KSII Transactions on Internet and Information Systems (TIIS) / v.14, no.10, 2020 , pp. 4007-4024 More about this Journal

Abstract

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

Keywords

Knowledge representation; decision trees; binary split; directed acyclic graph;

Citations & Related Records

Reference

1	AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining, Intelligent Systems Reference Library, Springer, vol. 146, 2019.
2	Alsolami, F., Azad, M., Chikalov, I., Moshkov, M., Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions, Intelligent Systems Reference Library, vol. 156. Springer, 2020.
3	Azad, M., Chikalov, I., Moshkov, M., "Decision trees for knowledge representation," in Proc. of Ropiak, K., Polkowski, L., Artiemjew, P. (Eds.), 28th International Workshop on Concurrency, Specification and Programming, CS&P 2019, Olsztyn, Poland, September 24-26, 2019.
4	Dua, D., Graff, C., UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences, 2019. http://archive.ics.uci.edu/ml
5	A. Alkhalid, T. Amin, I. Chikalov, S. Hussain, M. Moshkov, and B. Zielosko, "Dagger: A tool for analysis and optimization of decision trees and rules," in Proc. of Computational Informatics, Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiences in the Era of Communicability Expansion. Blue Herons Editions, Bergamo, Italy, pp. 29-39, 2011.
6	Azad, M, Decision and Inhibitory Trees for Decision Tables with Many-Valued Decisions, Doctoral Dissertation, King Abdullah University of Science & Technology, Thuwal, Saudi Arabia), 2018. Retrieved from http://hdl.handle.net/10754/628023
7	M. Azad, I. Chikalov, S. Hussain, and M. Moshkov., "Multi-pruning of decision trees for knowledge representation and classification," in Proc. of 3rd IAPR Asian Conference on Pattern Recognition, ACPR 2015, Kuala Lumpur, Malaysia, November 3-6, 2015, pp. 604-608, 2015.
8	Moret, B.M.E., Thomason, M.G., Gonzalez, R.C., "The activity of a variable and its relation to decision trees," ACM Trans. Program. Lang. Syst., 2(4), 580-595, 1980. DOI
9	Chikalov, I., Hussain, S., Moshkov, M., "Totally optimal decision trees for Boolean functions," Discret. Appl. Math., 215, 1-13, 2016. DOI
10	Hyafil, L.,Rivest, R.L., "Constructing optimal binary decision trees is NP-complete," Inf. Process. Lett., 5(1), 15-17, 1976. DOI
11	Riddle, P., Segal, R., Etzioni, O., "Representation design and brute-force induction in a Boeing manufacturing domain," Appl. Artif. Intel., 8, 125-147, 1994. DOI
12	Chai, B., Zhuang, X., Zhao, Y., Sklansky, J., "Binary linear decision tree with genetic algorithm," in Proc. of 13th International Conference on Pattern Recognition, ICPR 1996, Vienna, Austria, August 25-29, vol. 4, pp. 530-534, 1996.
13	Boryczka, U., Kozak, J., "New algorithms for generation decision trees - ant-miner and its modifications," Abraham A., Hassanien A.E, de Leon Ferreira de Carvalho A.C.P., Snasel V. (eds.) Foundations of Computational Intelligence-Volume 6: Data Mining, pp. 229-262, 2009.
14	Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J., Classification and Regression Trees, Wadsworth and Brooks, Monterey, CA, 1984.
15	Breitbart, Y., Reiter, A., "A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic boolean functions," Acta Inf., 4, 311-319, 1975. DOI
16	Garey, M.R., "Optimal binary identification procedures," SIAM J. Appl. Math, 23(2), 173-186, 1972. DOI
17	Heath, D.G., Kasif, S., Salzberg, S., "Induction of oblique decision trees," in Proc. of Bajcsy R. (ed.) 13th International Joint Conference on Artificial Intelligence, IJCAI 1993, Chambery, France, August 28-September 3, 1993, Morgan Kaufmann, pp. 1002-1007, 1993.
18	Martelli, A., Montanari, U., "Optimizing decision trees through heuristically guided search," Commun. ACM, 21(12), 1025-1039, 1978. DOI
19	Schumacher, H., Sevcik, K.C., "The synthetic approach to decision table conversion," Commun. ACM, 19(6), 343-351, 1976. DOI
20	Pawlak, Z., Rough Sets - Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Dordrecht, 1991.
21	Riddle, P., Segal, R., Etzioni, O., "Representation design and brute-force induction in a Boeing manufacturing domain," Appl. Artif. Intel, 8(1), 125-147, 1994. DOI
22	Pawlak, Z., Skowron, A., "Rudiments of rough sets," Inf. Sci., 177(1), 3-27, 2007. DOI
23	Moshkov, M., "Time complexity of decision trees," Peters, J.F., Skowron, A. (eds.) Trans. Rough Sets III. Lecture Notes in Computer Science, vol. 3400, pp. 244-459, 2005.
24	J. Demsar, "Statistical comparisons of classifiers over multiple data sets," Journal of Machine Learning Research, vol. 7, pp. 1-30, Dec. 2006.