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
On Compressible Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Time complexity of decision trees
Transactions on Rough Sets III
Compressible Infinite Information Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
In the paper infinite information systems are investigated which are used in pattern recognition,discrete optimization, computational geometry. The depth and the size of deterministic and nondeterministic decision trees over such information systems are studied. A partition of the set of all infinite information systems on two classes is considered. Systems from the first class are near to the best from the point of view of deterministic and nondeterministic decision tree time and space complexity. Decision trees for systems from the second class have in the worst case large time or space complexity. In proofs (which are too long and not included to the paper) methods of test theory [1, 2] and rough set theory [8,9] are used.