Fundamenta Informaticae · 2007 · 18 citations · 5 references
ComputingComputer ScienceMathematicsAlgorithmsSet TheoryTheory Of ComputationAlgorithmic ComplexityBoolean AlgebraComputational ComplexityStructural ComplexityBinary Decision DiagramsComplexity Of Boolean FunctionsComplexity-theoretic HardnessDecision RulesLower BoundsReducibility
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.
5
Dominik Ślȩzak · Fundamenta Informaticae · 2002 · 272 citations
α-RST: a generalization of rough set theory
Mohamed Quafafou · Information Sciences · 2000 · 142 citations
Ensembles of Classifiers Based on Approximate Reducts
Jakub Wróblewski · 2001 · 83 citations