Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
This book explores, within the framework of rough set theory, the complexity of decision trees and decision rule systems and the relationships between them for problems over information systems, for decision tables from closed classes, and for problems involving formal languages.
Introduction.- Problems Over Information Systems.- Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Global Approach.- Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach.- Time and Space Complexity of Deterministic and Nondeterministic Decision Trees Global Approach.- Time and Space Complexity of Deterministic and Nondeterministic Decision Trees Local Approach.- Decision Tables from Closed Classes.- Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes.- Complexity of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes.- Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes.- Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables with 0 1 Decisions from Closed Classes.- Recognition and Membership Problems for Formal Languages.- Decision Trees for Binary Subword closed Languages.- Transforming Decision Rule Systems into Deterministic Decision Trees.- Bounds on Depth of Decision Trees Derived from Decision Rule Systems.- Construction of Decision Trees and Acyclic Decision Graphs from Decision Rule Systems.