Decision rules for decision tables with many-valued decisions

Authors:
Igor Chikalov;Beata Zielosko
Affiliations:
Mathematical and Computer Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia and Institute of Computer Science, University of Silesia, Sosn ...
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 4
Cited 1

A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Approximate entropy reducts

Fundamenta Informaticae
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications

Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications

A Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions --A Comparative Study

Fundamenta Informaticae - Concurrency, Specification and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be over-fitted, so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length.