Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
On Efficient Construction of Decision Trees from Large Databases
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Consecutive Optimization of Decision Trees Concerning Various Complexity Measures
Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
On optimization of decision trees
Transactions on Rough Sets IV
Relationships between Average Depth and Number of Misclassifications for Decision Trees
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Hi-index | 0.00 |
The paper describes a tool which allows us for relatively small decision tables to make consecutive optimization of decision trees relative to various complexity measures such as number of nodes, average depth, and depth, and to find parameters and the number of optimal decision trees.