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
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Compressible infinite information systems
Fundamenta Informaticae
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, and computational geometry. An information system is called compressible relatively to a weight function if for each problem with enough big weight (total weight of attributes in problem description) there exists a decision tree which solves this problem and which weighted depth is less than the problem weight. In the paper all pairs of information systems and weight functions are described such that the information system is compressible relatively to the weight function.