Deterministic and Nondeterministic Decision Trees for Rough Computing

Article type: Research Article

Authors: Moshkov, Mikhail

Affiliations: 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

Note: [] Address for correspondence: Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia

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.

DOI: 10.3233/FI-2000-41303

Journal: Fundamenta Informaticae, vol. 41, no. 3, pp. 301-311, 2000