Classification of infinite information systems depending on complexity of decision trees and decision rule systems

Authors:
Mikhail Ju. Moshkov
Affiliations:
Faculty of Computing Mathematics and Cybernetics of Nizhny Novgorod State University, 23, Gagarina Av., Nizhny Novgorod, 603950, Russia
Venue:
Fundamenta Informaticae
Year:
2002

Citing 4
Cited 3

Unimprovable upper bounds on time complexity of decision trees

Fundamenta Informaticae
Deterministic and nondeterministic decision trees for rough computing

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Classification of Infinite Information Systems

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing

Compressible infinite information systems

Fundamenta Informaticae
Greedy Algorithm with Weights for Decision Tree Construction

Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Time complexity of decision trees

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, infinite information systems used in pattern recognition, data mining, discrete optimization, and computational geometry are investigated. Time and space complexity of decision trees and complete decision rule systems are studied. A partition of the set of all infinite information systems into two classes is considered. Information systems from the first class are close to the best from the point of view of time and space complexity of decision trees and decision rule systems. Decision trees and decision rule systems for information systems from the second class have in the worst case large time or space complexity.