On Complexity of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes.
Azimkhon OstonovMikhail MoshkovPublished in: IJCRS (1) (2024)
Keyphrases
- decision table
- decision trees
- decision rules
- variable precision
- rough set theory
- attribute reduction
- decision tree induction
- information entropy
- knowledge reduction
- rough sets
- naive bayes
- flow graphs
- rule induction
- training data
- classification rules
- random forest
- decision making
- discernibility matrix
- attribute values
- condition attributes
- support vector
- artificial intelligence
- variable precision rough set
- classification error
- rule sets
- decision problems
- training set