'Misclassification error' greedy heuristic to construct decision trees for inconsistent decision tables

Abstract
A greedy algorithm has been presented in this paper to construct decision trees for three different approaches (many-valued decision, most common decision, and generalized decision) in order to handle the inconsistency of multiple decisions in a decision table. In this algorithm, a greedy heuristic ‘misclassification error’ is used which performs faster, and for some cost function, results are better than ‘number of boundary subtables’ heuristic in literature. Therefore, it can be used in the case of larger data sets and does not require huge amount of memory. Experimental results of depth, average depth and number of nodes of decision trees constructed by this algorithm are compared in the framework of each of the three approaches.

Citation
Azad, M., & Moshkov, M. (2014). “Misclassification Error” Greedy Heuristic to Construct Decision Trees for Inconsistent Decision Tables. Proceedings of the International Conference on Knowledge Discovery and Information Retrieval. doi:10.5220/0005059201840191

Publisher
Scitepress

Journal
Proceedings of the International Conference on Knowledge Discovery and Information Retrieval

Conference/Event Name
6th International Conference on Knowledge Discovery and Information Retrieval, KDIR 2014

DOI
10.5220/0005059201840191

Permanent link to this record