Upper bounds on minimum cardinality of exact and approximate reducts

Authors:
Igor Chikalov;Mikhail Moshkov;Beata Zielosko
Affiliations:
Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia;Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Year:
2010

Citing 7
Cited 0

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
Approximate entropy reducts

Fundamenta Informaticae
Ensembles of Classifiers Based on Approximate Reducts

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Universal Attribute Reduction Problem

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications

Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications
Order based genetic algorithms for the search of approximate entropy reducts

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case.