Simulating functioning of decision trees for tasks on decision rule systems
From MaRDI portal
Cites work
- Bounds on depth of decision trees derived from decision rule systems with discrete attributes
- Combinatorial machine learning. A rough set approach.
- Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach
- Complexity measures and decision tree complexity: a survey.
- Decision and inhibitory trees and rules for decision tables with many-valued decisions
- Decision trees versus systems of decision rules. A rough set approach
- Foundations of Rule Learning
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 741345 (Why is no real title available?)
- scientific article; zbMATH DE number 1059897 (Why is no real title available?)
- scientific article; zbMATH DE number 2064222 (Why is no real title available?)
- scientific article; zbMATH DE number 1455627 (Why is no real title available?)
- scientific article; zbMATH DE number 845932 (Why is no real title available?)
- Logical analysis of numerical data
- Partial covers, reducts and decision rules in rough sets. Theory and applications
- Query complexity, or why is it difficult to separate NP^ A coNP^ A from P^ A by random oracles A?
- Rudiments of rough sets
- Three approaches to data analysis. Test theory, rough sets and logical analysis of data.
- Transactions on Rough Sets III
This page was built for publication: Simulating functioning of decision trees for tasks on decision rule systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013556)
