• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Knowledge Representation Using Decision Trees Constructed Based on Binary Splits

Vol. 14, No. 10, October 31, 2020
10.3837/tiis.2020.10.005, Download Paper (Free):

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.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
M. Azad, "Knowledge Representation Using Decision Trees Constructed Based on Binary Splits," KSII Transactions on Internet and Information Systems, vol. 14, no. 10, pp. 4007-4024, 2020. DOI: 10.3837/tiis.2020.10.005.

[ACM Style]
Mohammad Azad. 2020. Knowledge Representation Using Decision Trees Constructed Based on Binary Splits. KSII Transactions on Internet and Information Systems, 14, 10, (2020), 4007-4024. DOI: 10.3837/tiis.2020.10.005.