Publication | Closed Access
New Binary Discernibility Matrix and the Computation of a Core
11
Citations
0
References
2004
Year
Computational Complexity TheoryEngineeringBinary Discernibility MatrixData MiningDecision TableFormal MethodsComputational ComplexityTime ComplexityComputer ScienceDiscrete MathematicsMatrix TheoryRough SetComputability Theory
First, with a counterexample we point out in this paper an error in reference [4] for calculating the core of a decision table in the context of rough set based on the binary discernibility matrix defined by R.Felix et al. Then, we present a new binary discernibility matrix definition together with a method for the computation of the core and prove the correctness of the method.