Total Path Length and Number of Terminal Nodes for Decision Trees
Permanent link to this recordhttp://hdl.handle.net/10754/552376
MetadataShow full item record
AbstractThis paper presents a new tool for study of relationships between total path length (average depth) and number of terminal nodes for decision trees. These relationships are important from the point of view of optimization of decision trees. In this particular case of total path length and number of terminal nodes, the relationships between these two cost functions are closely related with space-time trade-off. In addition to algorithm to compute the relationships, the paper also presents results of experiments with datasets from UCI ML Repository1. These experiments show how two cost functions behave for a given decision table and the resulting plots show the Pareto frontier or Pareto set of optimal points. Furthermore, in some cases this Pareto frontier is a singleton showing the total optimality of decision trees for the given decision table.
CitationTotal Path Length and Number of Terminal Nodes for Decision Trees 2014, 35:514 Procedia Computer Science
JournalProcedia Computer Science
Conference/Event nameInternational Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2014