Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions

Authors:
Mohammad Azad;Igor Chikalov;Mikhail Moshkov;Beata Zielosko
Affiliations:
Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia, {mohammad.azad, igor.chikalov, mikhail.moshkov, beat ...;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia, {mohammad.azad, igor.chikalov, mikhail.moshkov, beat ...;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia, {mohammad.azad, igor.chikalov, mikhail.moshkov, beat ...;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia, {mohammad.azad, igor.chikalov, mikhail.moshkov, beat ...
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Year:
2012

Citing 5
Cited 1

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Approximate Reducts and Association Rules - Correspondence and Complexity Results

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications

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

Fundamenta Informaticae
Combinatorial Machine Learning: A Rough Set Approach

Combinatorial Machine Learning: A Rough Set Approach

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

The paper is devoted to the study of a greedy algorithm for construction of approximate tests super-reducts. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the cardinality of tests.