TY - GEN
T1 - Construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules
AU - Moshkov, Mikhail Ju
AU - Piliszczuk, Marcin
AU - Zielosko, Beata
PY - 2008
Y1 - 2008
N2 - In this chapter, we study problems of construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules. We describe briefly the results obtained for irreducible partial covers. Let A be a set with n elements, S be a family of m subsets of A, and t be a natural number. We consider so-called t -covers for the set cover problem (A, S). A t -cover is a subfamily of S, subsets from which cover at least n - t elements from A. A t -cover is called irreducible if each proper subfamily of this t -cover is not a t -cover. We study the problem of construction of all irreducible t -covers for a given set cover problem.
AB - In this chapter, we study problems of construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules. We describe briefly the results obtained for irreducible partial covers. Let A be a set with n elements, S be a family of m subsets of A, and t be a natural number. We consider so-called t -covers for the set cover problem (A, S). A t -cover is a subfamily of S, subsets from which cover at least n - t elements from A. A t -cover is called irreducible if each proper subfamily of this t -cover is not a t -cover. We study the problem of construction of all irreducible t -covers for a given set cover problem.
UR - http://www.scopus.com/inward/record.url?scp=51649121109&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69029-0_4
DO - 10.1007/978-3-540-69029-0_4
M3 - Conference contribution
AN - SCOPUS:51649121109
SN - 9783540690276
VL - 145
T3 - Studies in Computational Intelligence
SP - 97
EP - 116
BT - Partial Covers, Reducts and Decision Rules in Rough Sets
ER -