Comparative analysis of deterministic and nondeterministic decision tree complexity local approach

Authors:
Mikhail Ju. Moshkov
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
Transactions on Rough Sets IV
Year:
2005

Citing 8
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Comparative analysis of deterministic and nondeterministic decision tree complexity. Global approach

Fundamenta Informaticae
Rough set algorithms in classification problem

Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Induction of Decision Trees

Machine Learning
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Rough sets perspective on data and knowledge

Handbook of data mining and knowledge discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

For problems over arbitrary information system we study the relationships among the complexity of a problem description, the minimal complexity of a decision tree solving this problem deterministically, and the minimal complexity of a decision tree solving this problem nondeterministically. We consider the local approach to investigation of decision trees where only attributes from a problem description are used for construction of decision trees solving this problem.