On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes

Authors:
Igor Chikalov
Affiliations:
-
Venue:
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Year:
2000

Citing 2
Cited 8

On algorithm for constructing of decision trees with minimal depth

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Sequential optimization of matrix chain multiplication relative to different cost functions

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Time complexity of decision trees

Transactions on Rough Sets III
On optimization of decision trees

Transactions on Rough Sets IV
Consecutive Optimization of Decision Trees Concerning Various Complexity Measures

Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Quantitative analysis for covering-based rough sets through the upper approximation number

Information Sciences: an International Journal
Dynamic programming approach to optimization of approximate decision rules

Information Sciences: an International Journal
Sequential optimization of binary search trees for multiple cost functions

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sequential optimization of binary search trees for multiple cost functions

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is considered which for a given decision table constructs a decision tree with minimal number of nodes. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.