Affiliations: Institute of Computer Science, University of Silesia,
39, B�dzińska St., Sosnowiec, 41-200, Poland. E-mail:
moshkov@us.edu.pl | ING Bank Śl�ski S.A., 34, Sokolska St.,
Katowice, 40-086, Poland. E-mail: marcin.piliszczuk@ingbank.pl | Institute of Computer Science, University of Silesia,
39, B�dzińska St., Sosnowiec, 41-200, Poland. E-mail:
zielosko@us.edu.pl
Abstract: 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.
