Deterministic and nondeterministic decision trees for rough computing

• Autorzy: Moshkov, M.
• Języki publikacji: EN

Abstrakty

EN

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 and rough set theory are used.

Słowa kluczowe

EN

pattern recognition; discrete optimization; computational geometry

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2000
• Tom: Vol. 41, Nr 3
• Strony: 301-311
• Opis fizyczny: bibliogr. 9 poz.

Twórcy

autor

Moshkov, M.

• Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia