We used decision tree as a model to discover the knowledge from multi-label decision tables where each row has a set of decisions attached to it and our goal is to find out one arbitrary decision from the set of decisions attached to a row. The size of the decision tree can be small as well as very large. We study here different greedy as well as dynamic programming algorithms to minimize the size of the decision trees. When we compare the optimal result from dynamic programming algorithm, we found some greedy algorithms produce results which are close to the optimal result for the minimization of number of nodes (at most 18.92% difference), number of nonterminal nodes (at most 20.76% difference), and number of terminal nodes (at most 18.71% difference).
|Original language||English (US)|
|Title of host publication||Proceedings of the 2014 Federated Conference on Computer Science and Information Systems|
|Publisher||Polish Information Processing Society PTI|
|Number of pages||8|
|State||Published - Sep 29 2014|