&agr;-RST: a generalization of rough set theory
Information Sciences—Informatics and Computer Science: An International Journal
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
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis
Fundamenta Informaticae
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
On partial tests and partial reducts for decision tables
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
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
Universal Problem of Attribute Reduction
Transactions on Rough Sets IX
From Information System to Decision Support System
Transactions on Rough Sets IX
Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
Transactions on Computational Science V
| Hi-index | 0.00 |
In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.