Deterministic and Nondeterministic Decision Trees for Rough Computing

Authors:
Mikhail Moshkov
Affiliations:
(Correspd.) Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia. e-mail: moshkov@nnucnit.unn.ac.ru
Venue:
Fundamenta Informaticae
Year:
2000

Citing 3
Cited 1

Comparative analysis of deterministic and nondeterministic decision tree complexity. Global approach

Fundamenta Informaticae
Unimprovable upper bounds on time complexity of decision trees

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Classification of Infinite Information Systems Depending on Complexity of Decision Trees and Decision Rule Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, infinite information systems are considered which are used in pattern recognition, discrete optimization, computational geometry. Depth and size of deterministic and nondeterministic decision trees over such information systems are studied. Two classes of infinite information systems are investigated. Systems from these classes are best from the point of view of time complexity and space complexity of deterministic as well as nondeterministic decision trees. In proofs methods of test theory [1] and rough set theory [6, 9] are used.